Haplotype inference in general pedigrees with two sites

BackgroundGenetic disease studies investigate relationships between changes in chromosomes and genetic diseases. Single haplotypes provide useful information for these studies but extracting single haplotypes directly by biochemical methods is expensive. A computational method to infer haplotypes from genotype data is therefore important. We investigate the problem of computing the minimum number of recombination events for general pedigrees with two sites for all members.ResultsWe show that this NP-hard problem can be parametrically reduced to the Bipartization by Edge Removal problem and therefore can be solved by an O(2k · n2) exact algorithm, where n is the number of members and k is the number of recombination events.ConclusionsOur work can therefore be useful for genetic disease studies to track down how changes in haplotypes such as recombinations relate to genetic disease.

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

[2]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[3]  Shaoji Xu.  The line index and minimum cut of weighted graphs , 1998, Eur. J. Oper. Res..

[4]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[5]  Dan Gusfield,et al.  An Overview of Combinatorial Methods for Haplotype Inference , 2002, Computational Methods for SNPs and Haplotype Inference.

[6]  Andrew G. Clark,et al.  Computational Methods for SNPs and Haplotype Inference , 2002, Lecture Notes in Computer Science.

[7]  D. Qian,et al.  Minimum-recombinant haplotyping in pedigrees. , 2002, American journal of human genetics.

[8]  M. Waterman,et al.  Proceedings of the seventh annual international conference on Research in computational molecular biology , 2003, RECOMB 2003.

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

[10]  Tao Jiang,et al.  Efficient rule-based haplotyping algorithms for pedigree data , 2003, RECOMB '03.

[11]  Tao Jiang,et al.  An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming , 2004, RECOMB.

[12]  Bruce A. Reed,et al.  Finding odd cycle transversals , 2004, Oper. Res. Lett..

[13]  Hongyu Zhao,et al.  HAPLORE: a program for haplotype reconstruction in general pedigrees without recombination , 2005, Bioinform..

[14]  Ming-Yang Kao,et al.  Linear-Time Haplotype Inference on Pedigrees Without Recombinations , 2006, WABI.

[15]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..

[16]  Dimitrios M. Thilikos,et al.  Invitation to fixed-parameter algorithms , 2007, Comput. Sci. Rev..

[17]  Jing Xiao,et al.  Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree , 2007, SODA '07.

[18]  Jing Xiao,et al.  Complexity and approximation of the minimum recombinant haplotype configuration problem , 2005, Theor. Comput. Sci..

[19]  Jing Xiao,et al.  An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract) , 2009, ESA.

[20]  Patricia A. Evans,et al.  A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees , 2010, J. Comput. Biol..

[21]  Jing Xiao,et al.  An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants , 2011, Algorithmica.