{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T15:05:23Z","timestamp":1770217523346,"version":"3.49.0"},"reference-count":7,"publisher":"Oxford University Press (OUP)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: In family-based genetic studies, it is often useful to identify a subset of unrelated individuals. When such studies are conducted in population isolates, however, most if not all individuals are often detectably related to each other. To identify a set of maximally unrelated (or equivalently, minimally related) individuals, we have implemented simulated annealing, a general-purpose algorithm for solving difficult combinatorial optimization problems. We illustrate our method on data from a genetic study in the Old Order Amish of Lancaster County, Pennsylvania, a population isolate derived from a modest number of founders. Given one or more pedigrees, our program automatically and rapidly extracts a fixed number of maximally unrelated individuals.<\/jats:p>\n               <jats:p>Availability: \u00a0http:\/\/www.hg.med.umich.edu\/labs\/douglaslab\/software.html (version 1.0.0)<\/jats:p>\n               <jats:p>Contact: \u00a0jddoug@umich.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/btn087","type":"journal-article","created":{"date-parts":[[2008,3,6]],"date-time":"2008-03-06T01:25:31Z","timestamp":1204766731000},"page":"1106-1108","source":"Crossref","is-referenced-by-count":6,"title":["PedMine\u2014a simulated annealing algorithm to identify maximally unrelated individuals in population isolates"],"prefix":"10.1093","volume":"24","author":[{"given":"Julie A.","family":"Douglas","sequence":"first","affiliation":[{"name":"1 Department of Human Genetics and 2Program in Bioinformatics, University of Michigan, Ann Arbor, MI 48109, USA"},{"name":"1 Department of Human Genetics and 2Program in Bioinformatics, University of Michigan, Ann Arbor, MI 48109, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Conner I.","family":"Sandefur","sequence":"additional","affiliation":[{"name":"1 Department of Human Genetics and 2Program in Bioinformatics, University of Michigan, Ann Arbor, MI 48109, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2008,3,5]]},"reference":[{"key":"2023020210004565500_B1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1101\/gr.8.3.211","article-title":"Software for constructing and verifying pedigrees within large genealogies and an application to the Old Order Amish of Lancaster County","volume":"8","author":"Agarwala","year":"1998","journal-title":"Genome Res."},{"key":"2023020210004565500_B2","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1353\/hub.2001.0045","article-title":"Towards a complete North American Anabaptist genealogy II: analysis of inbreeding","volume":"73","author":"Agarwala","year":"2001","journal-title":"Hum. Biol."},{"key":"2023020210004565500_B3","volume-title":"Theory of Computation: Formal Languages, Automata, and Complexity","author":"Brookshear","year":"1989"},{"key":"2023020210004565500_B4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"A thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm","volume":"45","author":"Cerny","year":"1985","journal-title":"J. Optimiz. Theory App."},{"key":"2023020210004565500_B5","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"2023020210004565500_B6","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21750-5","volume-title":"Mathematical and Statistical Methods for Genetic Analysis","author":"Lange","year":"2002"},{"key":"2023020210004565500_B7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1093\/bioinformatics\/19.2.291","article-title":"Pedstrip: extracting a maximal subset of available, unrelated individuals from a pedigree","volume":"19","author":"Martin","year":"2003","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/8\/1106\/49046281\/bioinformatics_24_8_1106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/8\/1106\/49046281\/bioinformatics_24_8_1106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T10:02:13Z","timestamp":1675332133000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/24\/8\/1106\/213667"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,5]]},"references-count":7,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2008,4,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btn087","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2008,4,15]]},"published":{"date-parts":[[2008,3,5]]}}}