Fast scaffolding with small independent mixed integer programs

Bioinformatics

Volumn 27, Issue 23, 2011, Pages 3259-3265

  Salmela, Leena ^a   Mäkinen, Veli ^a   Välimäki, Niko ^a   Ylinen, Johannes ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; CAENORHABDITIS ELEGANS; COMPUTER PROGRAM; DNA SEQUENCE; ESCHERICHIA COLI; GENETICS; GENOME; HIGH THROUGHPUT SEQUENCING; METHODOLOGY; PSEUDOMONAS SYRINGAE;

ALGORITHMS; ANIMALS; CAENORHABDITIS ELEGANS; ESCHERICHIA COLI; GENOME; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; PSEUDOMONAS SYRINGAE; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 82255185486     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btr562     Document Type: Article

References (16)

1. Abouelhoda, M. (2007) A chaining algorithm for mapping cdna sequences to multiple genomic sequences. In Proceedings of SPIRE'07, vol. 4726 of LNCS, Springer, Heidelberg, pp. 1-13.
2. Boetzer, M. et al. (2011) Scaffolding pre-assembled contigs using SSPACE. Bioinformatics, 27, 578-579.
3. Butler, J. et al. (2008) ALLPATHS: de novo assembly of whole-genome shotgun microreads. Genome Res., 18, 810-820.
4. Dayarian, A. et al. (2010) SOPRA: scaffolding algorithm for paired reads via statistical optimization. BMC Bioinformatics, 11, 345.
5. Gnerre, S. et al. (2011) High-quality draft assemblies of mammalian genomes from massively parallel sequence data. Proc. Natl Acad. Sci. USA, 108, 1513-1518.
6. Kececioglu, J.D. and Myers, E.W. (1995) Combinatorial algorithms for DNA sequence assembly. Algorithmica, 13, 7-51.
7. Li, H.; 1000 Genome Project Data Processing Subgroup (2009) The sequence alignment/map (SAM) format and SAMtools. Bioinformatics, 25, 2078-2079.
8. Li, R. et al. (2009) SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics, 25, 1966-1967.
9. Li, R. et al. (2010) De novo assembly of human genomes with massively parallel short read sequencing. Genome Res., 20, 265-272.
10. Mäkinen, V. et al. (2010) Unified view of backward backtracking in short read mapping. In Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday, vol. 6060 of LNCS. Springer, Heidelberg, pp. 182-195.
11. Pop, M. (2009) Genome assembly reborn: recent computational challenges. Brief. Bioinformatics, 10, 354-366.
12. Pop, M. et al. (2004) Hierarchical scaffolding with Bambus. Genome Res., 14, 149-159.
13. Rasmussen, K. et al. (2006) Efficient q-gram filters for finding all epsilon-matches over a given length. J. Comp. Biol., 13, 296-308.
14. Simpson, J.T. et al. (2009) ABySS: a parallel assembler for short read sequence data. Genome Res., 19, 1117-1123.
15. Westbrook, J. and Tarjan, R.E. (1992) Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7, 433-464.
16. Zerbino, D.R. and Birney, E. (2008) Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res., 18, 821-829.