Unlabelled: 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.
Availability: http://www.hg.med.umich.edu/labs/douglaslab/software.html (version 1.0.0).
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2862369 | PMC |
http://dx.doi.org/10.1093/bioinformatics/btn087 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!