• Record: found
  • Abstract: found
  • Article: not found

Velvet: algorithms for de novo short read assembly using de Bruijn graphs.

Genome research

Algorithms, genetics, Streptococcus, standards, methods, Sequence Analysis, DNA, Mammals, Humans, Genomics, Genome, Human, Genome, Bacterial, Computer Simulation, Computational Biology, Chromosomes, Artificial, Bacterial, Animals

Read this article at

      There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.


      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 to very short reads and paired-ends information only, one can produce contigs of significant length, up to 50-kb N50 length in simulations of prokaryotic data and 3-kb N50 on simulated mammalian BACs. When applied to real Solexa data sets without read pairs, Velvet generated contigs of approximately 8 kb in a prokaryote and 2 kb in a mammalian BAC, in close agreement with our simulated results without read-pair information. Velvet represents a new approach to assembly that can leverage very short reads in combination with read pairs to produce useful assemblies.

      Related collections

      Author and article information



      Comment on this article