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

By Daniel R. Zerbino, Ewan Birney. 2008

9,778 citations recorded by the source corpus.

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.

Subfields: Molecular Biology, Plant Science

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Molecular Biology

  1. Steven L. Salzberg
  2. Heng Li
  3. Mihai Pop
  4. Sergey Koren
  5. Adam M. Phillippy
  6. Michael C. Schatz
  7. Richard Durbin
  8. Pavel A. Pevzner

In Plant Science

  1. Steven L. Salzberg
  2. Heng Li
  3. Mihai Pop
  4. Walter Pirovano
  5. Marten Boetzer
  6. Sergey Koren
  7. Rayan Chikhi
  8. Paul Medvedev

Citations in the corpus