On Approximating an Implicit Cover Problem in Biology

In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary algorithms. An important subclass of such problems is the implicit set cover (or, equivalently, hitting set) problem in which the sets are not given explicitly but rather defined implicitly. For example, the well-known minimum feedback arc set problem is such a problem. In this paper, we consider such a cover problem that arises in the study of wild populations in biology in which the sets are defined implicitly via the Mendelian constraints and prove approximability results for this problem.

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

[2]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[3]  W. Art Chaovalitwongse,et al.  Reconstructing sibling relationships in wild populations , 2007, ISMB/ECCB.

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

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

[6]  Ashfaq Khokhar,et al.  Consensus methods for reconstruction of sibling relationships from genetic data , 2008, AAAI 2008.

[7]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[8]  Bhaskar DasGupta,et al.  Error tolerant sibship reconstruction in wild populations. , 2008, Computational systems bioinformatics. Computational Systems Bioinformatics Conference.

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

[10]  B Dasgupta,et al.  KINALYZER, a computer program for reconstructing sibling groups , 2009, Molecular ecology resources.

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

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

[13]  Ming-Yang Kao,et al.  On approximating four covering and packing problems , 2009, J. Comput. Syst. Sci..

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

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

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

[17]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[18]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

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

[20]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[21]  Carsten Lund,et al.  Hardness of approximations , 1996 .

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

[23]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

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

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

[26]  Alberto Caprara,et al.  Packing triangles in bounded degree graphs , 2002, Inf. Process. Lett..

[27]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[28]  W. Art Chaovalitwongse,et al.  New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers , 2010, INFORMS J. Comput..

[29]  Robert Krauthgamer,et al.  Hardness of Approximation for Vertex-Connectivity Network Design Problems , 2004, SIAM J. Comput..

[30]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .