Back to Search Start Over

Discovering Kinship through Small Subsets.

Authors :
Brown, Daniel G.
Berger-Wolf, Tanya
Source :
Algorithms in Bioinformatics (9783642152931); 2010, p111-123, 13p
Publication Year :
2010

Abstract

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. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISBNs :
9783642152931
Database :
Complementary Index
Journal :
Algorithms in Bioinformatics (9783642152931)
Publication Type :
Book
Accession number :
76758484
Full Text :
https://doi.org/10.1007/978-3-642-15294-8_10