Reconstructing sibling relationships in wild populations

Reconstruction of sibling relationships from genetic data is an important component of many biological applications. In particular, the growing application of molecular markers (microsatellites) to study wild populations of plant and animals has created the need for new computational methods of establishing pedigree relationships, such as sibgroups, among individuals in these populations. Most current methods for sibship reconstruction from microsatellite data use statistical and heuristic techniques that rely on a priori knowledge about various parameter distributions. Moreover, these methods are designed for data with large number of sampled loci and small family groups, both of which typically do not hold for wild populations. We present a deterministic technique that parsimoniously reconstructs sibling groups using only Mendelian laws of inheritance. We validate our approach using both simulated and real biological data and compare it to other methods. Our method is highly accurate on real data and compares favorably with other methods on simulated data with few loci and large family groups. It is the only method that does not rely on a priori knowledge about the population under study. Thus, our method is particularly appropriate for reconstructing sibling groups in wild populations.

[1]  Jinliang Wang,et al.  Sibship reconstruction from genetic data with typing errors. , 2004, Genetics.

[2]  W. Art Chaovalitwongse,et al.  Set covering approach for reconstruction of sibling relationships , 2007, Optim. Methods Softw..

[3]  W. G. Hill,et al.  Sibship reconstruction in hierarchical population structures using Markov chain Monte Carlo techniques. , 2002, Genetical research.

[4]  Paul Sunnucks,et al.  Isolation and characterization of 20 polymorphic microsatellite loci for Scaptodrosophila hibisci , 2002 .

[5]  B. May,et al.  A graph‐theoretic approach to the partition of individuals into full‐sib families , 2003, Molecular ecology.

[6]  Anthony Almudevar,et al.  A simulated annealing algorithm for maximum likelihood pedigree reconstruction. , 2003, Theoretical population biology.

[7]  Jonathan M. Wright,et al.  Early growth performance of Atlantic salmon full-sib families reared in single family tanks versus in mixed family tanks , 1999 .

[8]  R. Karp,et al.  Efficient reconstruction of haplotype structure via perfect phylogeny. , 2002, Journal of bioinformatics and computational biology.

[9]  Tao Jiang,et al.  Efficient Inference of Haplotypes from Genotypes on a Pedigree , 2003, J. Bioinform. Comput. Biol..

[10]  Dan Gusfield,et al.  Partition-distance: A problem and class of perfect graphs arising in clustering , 2002, Inf. Process. Lett..

[11]  A. Jones,et al.  Methods of parentage analysis in natural populations , 2003, Molecular ecology.

[12]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[13]  Michael S. Blouin,et al.  DNA-based methods for pedigree reconstruction and kinship analysis in natural populations , 2003 .

[14]  Tanya Y. Berger-Wolf,et al.  Combinatorial Reconstruction of Sibling Relationships , 2005 .

[15]  Dany Garant,et al.  How to use molecular marker data to measure evolutionary parameters in wild populations , 2005, Molecular ecology.

[16]  Ian Painter,et al.  Sibship Reconstruction without Parental Information , 1997 .

[17]  C. Field,et al.  Accuracy, efficiency and robustness of four algorithms allowing full sibship reconstruction from DNA marker data , 2004, Molecular ecology.

[18]  C. Field,et al.  Estimation of Single-Generation Sibling Relationships Based on DNA Markers , 1999 .

[19]  D. Jerry,et al.  Development of a microsatellite DNA parentage marker suite for black tiger shrimp Penaeus monodon , 2006 .

[20]  B. Smith,et al.  Accurate partition of individuals into full-sib families from genetic data without parental information. , 2001, Genetics.

[21]  Dmitry A. Konovalov,et al.  kingroup: a program for pedigree relationship reconstruction and kin group assignments using genetic markers , 2004 .

[22]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.