Set covering approach for reconstruction of sibling relationships

A new combinatorial approach for modelling and reconstructing sibling relationships in a single generation of individuals without parental information is proposed in this paper. Simple genetic constraints on the full-sibling groups, imposed by the Mendelian inheritance rules, are employed to investigate data from codominant DNA markers. To extract the minimum number of biologically consistent sibling groups, the proposed combinatorial approach is employed to formulate this minimization problem as a set covering problem, which is a well-known NP-hard combinatorial optimization problem. We conducted a simulation study of a relaxed version of the proposed algorithm to demonstrate that our combinatorial approach is reasonably accurate and the exact version of the sibling relationship construction algorithm should be pursued. In addition, the results of this study suggest that the proposed algorithm will pave our way to a new approach in computational population genetics as it does not require any a priori knowledge about allele frequency, population size, mating system or family size distributions to reconstruct sibling relationships.

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

[2]  Lawrence R. Rabiner,et al.  Combinatorial optimization:Algorithms and complexity , 1984 .

[3]  Egon Balas,et al.  On the set covering polytope: I. All the facets with coefficients in {0, 1, 2} , 1986, Math. Program..

[4]  Yuri Kochetov,et al.  Behavior of the Ant Colony Algorithm for the Set Covering Problem , 2000 .

[5]  J. Beasley,et al.  A genetic algorithm for the set covering problem , 1996 .

[6]  J. Beasley.  An algorithm for set covering problem , 1987 .

[7]  Egon Balas,et al.  On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2} , 1989, Math. Program..

[8]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[9]  James T. Moore,et al.  A Hybrid Tabu Search/Set Partitioning Approach to Tanker Crew Scheduling , 2004 .

[10]  Anthony V. Fiacco,et al.  Mathematical programming study 21 , 1985, Mathematical programming.

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

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

[13]  Egon Balas,et al.  On the Set-Covering Problem , 1972, Oper. Res..

[14]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[15]  Francesco Maffioli,et al.  Approximability of hard combinatorial optimization problems: an introduction , 2000, Ann. Oper. Res..

[16]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[17]  J. Rubin.  A Technique for the Solution of Massive Set Covering Problems, with Application to Airline Crew Scheduling , 1973 .

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

[19]  Carlo Mannino,et al.  Solving hard set covering problems , 1995, Oper. Res. Lett..

[20]  R. E. Marsten,et al.  A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem , 1980 .

[21]  M. Blouin,et al.  Use of microsatellite loci to classify individuals by relatedness , 1996, Molecular ecology.

[22]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[23]  A. Eremeev.  A Genetic Algorithm with a Non-Binary Representation for the Set Covering Problem , 1999 .

[24]  J. Beasley,et al.  Enhancing an algorithm for set covering problems , 1992 .

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

[26]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

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

[28]  T. Grossman,et al.  Computational Experience with Approximation Algorithms for the Set Covering Problem , 1994 .

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

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Melvin A. Breuer,et al.  Simplification of the Covering Problem with Application to Boolean Expressions , 1970, JACM.

[32]  L. W. Jacobs,et al.  Note: A local-search heuristic for large set-covering problems , 1995 .

[33]  David Avis,et al.  SET COVERING PROBLEMS , 1980 .

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

[35]  Charles S. ReVelle,et al.  The Location of Emergency Service Facilities , 1971, Oper. Res..

[36]  Matteo Fischetti,et al.  Algorithms for the Set Covering Problem , 2000, Ann. Oper. Res..

[37]  Edward Keefer Baker,et al.  Efficient heuristic solutions for the airline crew scheduling problem , 1979 .

[38]  E. Balas.  A class of location, distribution and scheduling problems : modeling and solution methods , 1982 .

[39]  J. Beasley.  A lagrangian heuristic for set‐covering problems , 1990 .

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

[41]  Andrew C. Ho,et al.  Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study , 1980 .

[42]  John J. Bartholdi,et al.  A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering , 1981, Oper. Res..

[43]  Luca Trevisan,et al.  Non-approximability results for optimization problems on bounded degree instances , 2001, STOC '01.

[44]  Warren Walker,et al.  Using the Set-Covering Problem to Assign Fire Companies to Fire Houses , 1974, Oper. Res..

[45]  Matteo Fischetti,et al.  Algorithms for railway crew management , 1997, Math. Program..