On the complexity of several haplotyping problems

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

Volumn 3692 LNBI, Issue , 2005, Pages 128-139

  Cilibrasi, Rudi ^b   Van Iersel, Leo ^a   Kelk, Steven ^b   Tromp, John ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; ERROR CORRECTION; POLYNOMIAL APPROXIMATION; SET THEORY; TIME DOMAIN ANALYSIS;

HAPLOTYPING PROBLEMS; LONGEST HAPLOTYPE RECONSTRUCTION (LHR); MINIMUM ERROR CORRECTION (MEC); NP-HARD;

COMPUTATIONAL COMPLEXITY;

EID: 33646192744     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557067_11     Document Type: Conference Paper

References (20)

1. Noga Alon, Benny Sudakov, On Two Segmentation Problems, Journal of Algorithms 33, 173-184 (1999)
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation - Combinatorial optimization problems and their approximability properties, Springer Verlag (1999)
3. Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi, Polynomial and APX-hard cases of the individual haplotyping problem, Theoretical Computer Science, (2004)
4. Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Jing Li, The Haplotyping Problem: An Overview of Computational Models and Solutions, Journal of Computer Science and Technology 18(6), 675-688 (November 2003)
5. P. Drineas, A. Frieze, R. Kannan, S. Vempala, V. Vinay, Clustering in large graphs via Singular Value Decomposition, Journal of Machine Learning 56, 9-33 (2004)
6. F. Gavril, Testing for equality between maximum matching and minimum node covering, Information processing letters 6, 199-202 (1977)
7. Harvey J. Greenberg, William E. Hart, Giuseppe Lancia, Opportunities for Combinatorial Optimisation in Computational Biology, INFORMS Journal on Computing, Vol. 16, No. 3, 211-231 (Summer 2004)
8. Bjarni V. Halldorsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, and Sorin Istrail, A Survey of Computational Methods for Determining Haplotypes, Proceedings of the First, RECOMB Satellite on Computational Methods for SNPs and Haplotype Inference, Springer Lecture Notes in Bioinformatics, LNBI 2983, pp. 26-47 (2003)
9. 5/2 algorithm for maximum matching in bipartite graphs, SIAM Journal on Computing 2, 225-231 (1973)
10. Yishan Jiao, Jingyi Xu, Ming Li, On the k-Closest Substring and k-Consensns Pattern Problems, Combinatorial Pattern Matching: 15th Annual Symposium (CPM 2004) 130-144
11. Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan, Segmentation Problems, Proceedings of STOC 1998, 473-482 (1998)
12. Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan, A Microeconomic View of Data Mining, Data Mining and Knowledge Discovery 2, 311-324 (1998)
13. Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan, Segmentation Problems, Journal of the ACM 51(2), 263-280 (March 2004) Note: this paper is some-what different to the 1998 version.
14. Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross Lippert, and Russel Schwartz, SNPs Problems, Complexity and Algorithms, Proceedings of the 9th Annual European Symposium on Algorithms, 182-193 (2001)
15. Giuseppe Lancia, Maria Christina Pinotti, Romeo Rizzi, Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms, INFORMS Journal on Computing, Vol. 16, No.4, 348-359 (Fall 2004)
16. Giuseppe Lancia, Romeo Rizzi, A polynomial solution to a special case of the parsimony haplotyping problem, to appear in Operations Research Letters
17. Rafail Ostrovsky and Yuval Rabani, Polynomial-Time Approximation Schemes for Geometric Min-Sum Median Clustering, Journal of the ACM 49(2), 139-156 (March 2002)
18. Alessandro Panconesi and Mauro Sozio, Fast Hare: A Fast Heuristic for Single Individual SNP Haplotype Reconstruction, Proceedings of 4th Workshop on Algorithms in Bioinformatics (WABI 2004), LNCS Springer-Verlag, 266-277
19. Personal communication with Christos H. Papadimitriou, June 2005
20. Romeo Rizzi, Vineet Bafna, Sorin Istrail, Giuseppe Lancia: Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem, 2nd Workshop on Algorithms in Bioinformatics (WABI 2002) 29-43