4 search results - page 1 / 1 » IDBA - A Practical Iterative de Bruijn Graph De Novo Assembl... |
RECOMB
2010
Springer
13 years 11 months ago
2010
Springer
BMCBI
2010
13 years 5 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
WABI
2007
Springer
13 years 11 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
BMCBI
2010
13 years 5 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...