Original paper

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

Volume: 18, Issue: 5, Pages: 821 - 829
Published: Mar 18, 2008
Abstract
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...
Paper Details
Title
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
Published Date
Mar 18, 2008
Volume
18
Issue
5
Pages
821 - 829
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.