Complexity and approximation of the minimum recombination haplotype configuration problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 370-379

  Liu, Lan ^a   Chen, Xi ^b   Xiao, Jing ^b   Jiang, Tao ^a,b  

^a University of California Riverside   (United States)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Approximation; Bounded number; Children; Complexity; Haplotyping; L reduction; Mates; Negative result; Pedigree; Positive result; Recombinant; SNP

Indexed keywords

APPROXIMATION THEORY; DATA STRUCTURES; GAME THEORY; GENETIC ALGORITHMS; NUMBER THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

APPROXIMATION; BOUNDED NUMBER; COMPLEXITY; HAPLOTYPING; L-REDUCTION; NEGATIVE RESULT; PEDIGREE; POSITIVE RESULT; RECOMBINANT; SNP;

COMPUTATIONAL COMPLEXITY;

EID: 33744948186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_38     Document Type: Conference Paper

References (22)

1. J. Li and T. Jiang: Efficient rule-based haplotyping algorithm for pedigree data. Proc. of the 7th Annual Conference on Research in Computational Molecular Biology (RECOMB'03), pages 197-206, 2003.
2. K. Doi, J. Li and T. Jiang: Minimum recombinant haplotype configuration on tree pedigrees. Proc. of the 3rd Annual Workshop on Algorithms in Bioinformatics (WABI'03), pages 339-353, 2003.
3. L. Aceto et al.: The complexity of checking consistency of pedigree information and related problems. J. Comp. Sci. Tech., 19(1): 42-59, 2004.
4. S. Khot: On the power of 2-Prover 1-Round Games. Proc. of the 34th ACM Symposium on Theory of Computing (STOC'02), pages 767-775, 2002.
5. A. Agarwal, M. Charikar: O(√log(n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems. Proc. STOC'05, pages 573-581, 2005.
6. G. Ausiello et al.: Complexity and approximation: combinatorial optimization problems and their approximability properties, pages 276-279, Springer, 1999.
7. L. Jorde: Where we are hot, they are not. Science, Volume 308, pages 60-62, 2005.
8. L. Li, J.H. Kim, and M. S. Waterman: Haplotype reconstruction from SNP alignment. Proc. RECOMB'03, pages 207-216, 2003.
9. R. Lippert, et al.: Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Briefings in Bioinformatics 3(1): 23-31, 2002.
10. E. Eskin E. Halperin, and R.M. Karp: Large scale reconstruction of haplotypes from genotype data. Proc. RECOMB'03, pages 104-113, 2003.
11. L. Excoffier and M. Slatkin: Maximum-likelihood estimation of molecular haplotype frequencies in a diploid population. Mol. Biol. Evol., 12: 921-927, 1995.
12. H. Seltman, K. Roeder, and B. Devlin: Transmission/disequilibrium test meets measured haplotype analysis: family-based association analysis guided by evolution of haplotypes. Am. J. Hum. Genet., 68(5): 1250-1263, 2001.
13. S. Zhang et al.: Transmission/ disequilibrium test based on haplotype sharing for tightly linked markers. Am. J. Hum. Genet., 73(3): 556-579, 2003.
14. J. Li and T. Jiang: An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming. Proc. RECOMB'04, pages 20-29, 2004.
15. J.R. O'Connell: Zero-recombinant haplotyping: applications to fine mapping using SNPs. Genet. Epidemiol., 19 Suppl. 1: S64-70, 2000.
16. D. Qian and L. Beckmann: Minimum-recombinant haplotyping in pedigrees. Am. J. Hum. Genet., 70(6): 1434-1445, 2002.
17. The International HapMap Consortium: The International HapMap Project. Nature, Volume 426, pages 789-796, December 2003.
18. C.H. Papadimitriou and M. Yannakakis: Optimization, Approximation, and Complexity Classes. J. Comp. System Sci., pages 425-440, 1991.
19. M. Stephens, N. J. Smith, and P. Donnelly: A new statistical method for haplotype reconstruction from population data. Am. J. Hum. Genet., 68(4):978-989, 2001.
20. T.J. Schaefer: The complexity of satisfiability problems. Proc. of the 10th STOC, pages 216-226, 1978.
21. J. Li and T. Jiang: Computing the Minimum Recombinant Haplotype Configuration from incomplete genotype data on a pedigree by integer linear programming. Proc. RECOMB'04, pages 20-29, 2004.
22. Available at http://www.cs.ucr.edu/~lliu/App_MRHC.pdf.