SCARPA: Scaffolding reads with practical algorithms

Bioinformatics

Volumn 29, Issue 4, 2013, Pages 428-434

  Donmez, Nilgun ^a   Brudno, Michael ^a,b,c  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

^c HOSPITAL FOR SICK CHILDREN   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; ASCOMYCETES; COMPUTER PROGRAM; CONTIG MAPPING; ESCHERICHIA COLI; EVALUATION; GENETICS; GENOMICS; HIGH THROUGHPUT SEQUENCING; METHODOLOGY; SYSTEM ANALYSIS;

ALGORITHMS; ASCOMYCOTA; CONTIG MAPPING; ESCHERICHIA COLI; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; PROGRAMMING, LINEAR; SOFTWARE;

MLCS; MLOWN;

EID: 84874330144     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts716     Document Type: Article

References (19)

1. Boetzer, M. et al. (2011) Scaffolding pre-assembled contigs using SSPACE. Bioinformatics, 27, 578-579.
2. Dayarian, A. et al. (2010) SOPRA: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics, 11, 345.
3. Dent, D. et al. (2011) Assemblathon 1: a competitive assessment of de novo short read assembly methods. Genome Res., 21, 2224-2241.
4. DiGuistini, S. et al. (2009) De novo genome sequence assembly of a filamentous fungus using sanger, 454 and illumina sequence data. Genome Biol., 10, R94.
5. Donmez, N. and Brudno, M. (2011) Hapsembler: an assembler for highly polymorphic genomes. In: Bafna, V. and Sahinalp, S. (eds) Research in Computational Molecular Biology. Vol. 6577 of Lecture Notes in Computer Science. Springer, Berlin/Heidelberg, pp. 38-52.
6. Eades, P. et al. (1993) A fast effective heuristic for the feedback arc set problem. Inf. Process. Lett., 47, 319-323.
7. Gao, S. et al. (2011) Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. In: Bafna, V. and Sahinalp, S. (eds) Research in Computational Molecular Biology. Vol. 6577 of Lecture Notes in Computer Science. Springer, Berlin/Heidelberg, pp. 437-451.
8. Hopcroft, J. and Tarjan, R. (1973) Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM, 16, 372-378.
9. Huson, D.H. et al. (2002) The greedy path merging algorithm for contig scaffolding. J. ACM, 49, 6003-6015.
10. Karp, R.M. (1972) Reducibility among combinatorial problems. In:Miller, R.E. and Thatcher, J.W. (eds) Complexity of computer computations. Plenum, New York, pp. 85-103.
11. Kurtz, S. et al. (2004) Versatile and open software for comparing large genomes. Genome Biol., 5, R12.
12. Langmead, B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25.
13. Li, R. et al. (2009) De novo assembly of human genomes with massively parallel short read sequencing. Gemome Res., 20, 265-272.
14. Lokshtanov, D. et al. (2009) Simpler parameterized algorithm for OCT. In: Fiala, J. et al. (ed.) Combinatorial Algorithms. Springer, Berlin/Heidelberg, pp. 380-384.
15. Pop, M. et al. (2004) Hierarchical scaffolding with bambus. Genome Res., 14, 149-159.
16. Reed, B. et al. (2004) Finding odd cycle transversals. Oper. Res. Lett., 32, 299-301.
17. Salmela, L. et al. (2011) Fast scaffolding with small independent mixed integer programs. Bioinformatics, 27, 3259-3265.
18. Simpson, J.T. et al. (2009) ABySS: a parallel assembler for short read sequence data. Genome Res., 19, 1117-1123.
19. Zerbino, D.R. et al. (2009) Pebble and rock band: heuristic resolution of repeats and scaffolding in the velvet short-read de novo assembler. PLoS One, 4, e8407.