On the fixed parameter tractability and approximability of the minimum error correction problem

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

Volumn 9133, Issue , 2015, Pages 100-113

  Bonizzoni, Paola ^a   Dondi, Riccardo ^b   Klau, Gunnar W ^c,e   Pirola, Yuri ^a   Pisanti, Nadia ^d,e   Zaccaria, Simone ^a  

^a UNIVERSITY OF MILANO BICOCCA   (Italy)

^b UNIVERSITY OF BERGAMO   (Italy)

^c CWI   (Netherlands)

^d UNIVERSITY OF PISA   (Italy)

^e INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; ERROR CORRECTION; PATTERN MATCHING;

APPROXIMABILITY; COMBINATORIAL PROPERTIES; COMPUTATIONAL PROBLEM; CONSTANT FACTORS; FIXED-PARAMETER TRACTABILITY; MINIMUM ERROR CORRECTION; PARAMETERIZED; SEQUENCING ERRORS;

ERRORS;

EID: 84948972672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-19929-0_9     Document Type: Conference Paper

References (23)

1. Aguiar, D., Istrail, S.: HapCompass: a fast cycle basis algorithm for accurate haplotype assembly of sequence data. J. Comput. Biol. 19(6), 577-590 (2012)
2. Bansal, V., Bafna, V.: HapCUT: an efficient and accurate algorithm for the haplotype assembly problem. Bioinformatics 24(16), i153-i159 (2008)
3. Bonizzoni, P., Della Vedova, G., Dondi, R., Li, J.: The haplotyping problem: an overview of computational models and solutions. J. Comput. Sci. Techol. 18(6), 675-688 (2003)
4. Browning, B., Browning, S.: Haplotypic analysis of Wellcome Trust case control consortium data. Hum. Genet. 123(3), 273-280 (2008)
5. Chen, Z.Z., Deng, F., Wang, L.: Exact algorithms for haplotype assembly from whole-genome sequence data. Bioinformatics 29(16), 1938-45 (2013)
6. Cilibrasi, R., Van Iersel, L., Kelk, S., Tromp, J.: The complexity of the single individual SNP haplotyping problem. Algorithmica 49(1), 13-36 (2007)
7. Dondi, R.: New results for the Longest Haplotype Reconstruction problem. Discrete Appl. Math. 160(9), 1299-1310 (2012)
8. Fouilhoux, P., Mahjoub, A.: Solving VLSI design and DNA sequencing problems using bipartization of graphs. Comput. Optim. Appl. 51(2), 749-781 (2012)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
10. Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi) cut theorems and their applications. SIAM J. Comput. 25(2), 235-251 (1996)
11. Guo, J., et al.: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization. J. Comput. Syst. Sci. 72(8), 1386-1396 (2006)
12. Halldórsson, B.V., Aguiar, D., Istrail, S.: Haplotype phasing by multi-assembly of shared haplotypes: phase-dependent interactions between rare variants. In: PSB, pp. 88-99. World Scientific Publishing (2011)
13. He, D., et al.: Optimal algorithms for haplotype assembly from whole-genome sequence data. Bioinformatics 26(12), i183-i190 (2010)
14. Jiao, Y., Xu, J., Li, M.: On the k-closest substring and k-consensus pattern problems. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 130-144. Springer, Heidelberg (2004)
15. Khot, S.: On the power of unique 2-prover 1-round games. In: STOC, pp. 767-775. ACM (2002)
16. Kleinberg, J., Papadimitriou, C., Raghavan, P.: Segmentation problems. In: STOC, pp. 473-482. ACM (1998)
17. Lancia, G., Bafna, V., Istrail, S., Lippert, R., Schwartz, R.: SNPs problems, complexity, and algorithms. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 182-193. Springer, Heidelberg (2001)
18. Lippert, R., Schwartz, R., Lancia, G., Istrail, S.: Algorithmic strategies for the single nucleotide polymorphism haplotype assembly problem. Brief. Bioinform. 3(1), 23-31 (2002)
19. Ostrovsky, R., Rabani, Y.: Polynomial-time approximation schemes for geometric min-sum median clustering. J. ACM 49(2), 139-156 (2002)
20. Patterson, M., Marschall, T., Pisanti, N., van Iersel, L., Stougie, L., Klau, G.W., Schönhuth, A.: WhatsHap: haplotype assembly for future-generation sequencing reads. In: Sharan, R. (ed.) RECOMB 2014. LNCS (LNBI), vol. 8394, pp. 237-249. Springer, Heidelberg (2014)
21. Pirola, Y., Bonizzoni, P., Jiang, T.: An efficient algorithm for haplotype inference on pedigrees with recombinations and mutations. IEEE/ACM Trans. Comput. Biol. Bioinform. 9(1), 12-25 (2012)
22. Pirola, Y., et al.: Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes. In: BCB, pp. 33-41. ACM (2013)
23. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299-301 (2004)