Genome Research

Home Help [Feedback] [For Subscribers] [Archive] [Search] [Contents]
 QUICK SEARCH:   [advanced]


     


Published online before print April 7, 2008, 10.1101/gr.074492.107
Genome Res. 18:821-829, 2008
©2008 by Cold Spring Harbor Laboratory Press; ISSN 1088-9051/08 $5.00
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Supplemental Research Data
Right arrow All Versions of this Article:
gr.074492.107v1
gr.074492.107v2
18/5/821    most recent
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Right arrow Citation Map
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Google Scholar
Right arrow Articles by Zerbino, D. R.
Right arrow Articles by Birney, E.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Zerbino, D. R.
Right arrow Articles by Birney, E.
Related Content
Right arrowRelated Articles
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati  
What's this?

Resource

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

Daniel R. Zerbino and Ewan Birney1

EMBL-European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge CB10 1SD, United Kingdom

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 ~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.


1 Corresponding author.

E-mail birney{at}ebi.ac.uk; fax 44-1223-494-468.

[Supplemental material is available online at www.genome.org. The code for Velvet is freely available, under the GNU Public License, at http://www.ebi.ac.uk/~zerbino/velvet.]

Article published online before print. Article and publication date are at http://www.genome.org/cgi/doi/10.1101/gr.074492.107.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati    What's this?

Related Articles

De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer
David Hernandez, Patrice François, Laurent Farinelli, Magne Østerås, and Jacques Schrenzel
Genome Res. 2008 18: 802-809. [Abstract] [Full Text] [PDF]

ALLPATHS: De novo assembly of whole-genome shotgun microreads
Jonathan Butler, Iain MacCallum, Michael Kleber, Ilya A. Shlyakhter, Matthew K. Belmonte, Eric S. Lander, Chad Nusbaum, and David B. Jaffe
Genome Res. 2008 18: 810-820. [Abstract] [Full Text] [PDF]

SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing
Juliane C. Dohm, Claudio Lottaz, Tatiana Borodina, and Heinz Himmelbauer
Genome Res. 2007 17: 1697-1706. [Abstract] [Full Text] [PDF]






Home Help [Feedback] [For Subscribers] [Archive] [Search] [Contents]
Genes Dev. Learn. Mem.
Protein Science RNA Genome Res.
Copyright © 2008 by Cold Spring Harbor Laboratory Press.