Complexity and approximation of the minimum recombinant haplotype configuration problem

Theoretical Computer Science

Volumn 378, Issue 3, 2007, Pages 316-330

  Liu, Lan ^a   Xi, Chen ^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 ALGORITHMS; BINARY TREES; COMPUTATIONAL COMPLEXITY; DATA REDUCTION;

BOUNDED NUMBER; HAPLOTYPING; L-REDUCTION; NEGATIVE RESULT; PEDIGREE;

PROBLEM SOLVING;

EID: 34248224586     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.036     Document Type: Article

References (21)

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