Velvet: Algorithms for de novo short read assembly using de Bruijn graphs

We have developed a new set of algorithms, collectively called “Velvet,” to manipulate de Bruijn graphs for genomic sequence assembly. A de Bruijn graph is a compact representation based on short words ( k -mers) that is ideal for high coverage, very short read (25–50 bp) data sets. Applying Velvet ... View More