Gap filling as exact path length problem

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

Volumn 9029, Issue , 2015, Pages 281-292

  Salmela, Leena ^a   Sahlin, Kristoffer ^b   Mäkinen, Veli ^a   Tomescu, Alexandru I ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; FILLING; MOLECULAR BIOLOGY; POLYNOMIALS;

ARC COSTS; ERROR LEVELS; GAP FILLING; GAP LENGTH; GENOME ASSEMBLY; NP-HARD; PATH LENGTH; PROGRAMMING SOLUTIONS;

DYNAMIC PROGRAMMING;

EID: 84926361099     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-16706-0_29     Document Type: Conference Paper

References (20)

1. Boetzer, M., Pirovano, W.: Toward almost closed genomes with GapFiller. Genome Biology 13(6), R56 (2012)
2. Drezen, E., et al.: GATB: genome assembly & analysis tool box. Bioinformatics 30(20), 2959–2961 (2014)
3. Durbin, R., et al.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press (1998)
4. Dyer, M.E., et al.: A mildly exponential time algorithm for approximating the number of solutions to a multidimensional knapsack problem. Combinatorics, Probability & Computing 2(3), 271–284 (1993)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
6. Gnerre, S., et al.: High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proceedings of the National Academy of Sciences 108(4), 1513–1518 (2010)
7. Gurevich, A., et al.: QUAST: quality assessment tool for genome assemblies. Bioinformatics 29(8), 1072–1075 (2013)
8. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
9. Kurtz, S., et al.: Versatile and open software for comparing large genomes. Genome Biology 5(2), R12 (2004)
10. Langmead, B., et al.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology 10(3), R25 (2009)
11. Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25(14), 1754–1760 (2009)
12. Luo, R., et al.: SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler. GigaScience 1(18) (2012)
13. Nadalin, F., et al.: GapFiller: a de novo assembly approach to fill the gap within paired reads. BMC Bioinformatics 13(suppl. 14), S8 (2012)
14. Nykänen, M., Ukkonen, E.: The exact path length problem. J. Algorithms 42(1), 41–53 (2002)
15. Pabinger, S., et al.: A survey of tools for variant analysis of next-generation genome sequencing data. Briefings in Bioinformatics 15(2), 256–278 (2013)
16. Pevzner, P.A., Tang, H.: Fragment assembly with double-barreled data. Bioinformatics 17(suppl. 1), S225–S233 (2001)
17. Salzberg, S.L., et al.: GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Research 22(3), 557–567 (2012)
18. Simpson, J.T., Durbin, R.: Efficient de novo assembly of large genomes using compressed data structures. Genome Research 22, 549–556 (2012)
19. Simpson, J., et al.: ABySS: A parallel assembler for short read sequence data. Genome Research 19, 1117–1123 (2009)
20. Wetzel, J., et al.: Assessing the benefits of using mate-pairs to resolve repeats in de novo short-read prokaryotic assemblies. BMC Bioinformatics 12(1), 95 (2011)