Reconstructing sibling relationships in wild populations
Bioinformatics
On approximating four covering and packing problems
Journal of Computer and System Sciences
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers
INFORMS Journal on Computing
Pedigree reconstruction using identity by descent
RECOMB'11 Proceedings of the 15th Annual international conference on Research in computational molecular biology
SibJoin: a fast heuristic for half-sibling reconstruction
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |
In kinship inference, we identify genealogical relationships among organisms. One such problem is sibgroup reconstruction: given a population of same-generation individuals, partition it into sibgroups resulting from mating events. Minimizing the number of matings is NP- hard to approximate, yet a simple heuristic, based on identifying population triplets that can be from the same sibgroup, performs comparably to better than integer programming algorithms in a fraction of the running time. With high probability if we study many loci in the genome, and large populations, our polynomial-time heuristic finds the true sibgroups, assuming a standard probabilistic inheritance model.