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

@article{Zerbino2008VelvetAF,
  title={Velvet: algorithms for de novo short read assembly using de Bruijn graphs.},
  author={Daniel R. Zerbino and Ewan Birney},
  journal={Genome research},
  year={2008},
  volume={18 5},
  pages={821-9}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 960 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Recent Discussions
This paper has been referenced on Twitter 10 times over the past 90 days. VIEW TWEETS
4,384 Citations
33 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 4,384 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Assembly for double-ended short-read sequencing technologies. Advances in Genome Sequencing Technology and Algorithms

  • J. Chen, S. Skiena
  • Artech House Publishers,
  • 2007

Wholegenome sequencing and assembly with high throughput, short-read technologies

  • A. 631. Sundquist, M. Ronaghi, H. Tang, P Pevzner, S. Batzoglou
  • PLoS ONE
  • 2007
1 Excerpt

Similar Papers

Loading similar papers…