Related Experiment Video
Updated: Jul 6, 2026

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
Published on: December 7, 2021
PedMine--a simulated annealing algorithm to identify maximally unrelated individuals in population isolates
Julie A Douglas1, Conner I Sandefur
1Department of Human Genetics, University of Michigan, Ann Arbor, MI 48109, USA. jddoug@umich.edu
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).
Related Concept Videos
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
