4 search results - page 1 / 1 » IDBA - A Practical Iterative de Bruijn Graph De Novo Assembl... |
68
Voted
RECOMB
2010
Springer
15 years 7 months ago
2010
Springer
112
Voted
BMCBI
2010
15 years 16 days 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
15 years 6 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...
101
Voted
BMCBI
2010
15 years 16 days 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...