Skip Navigation


Bioinformatics Advance Access originally published online on September 24, 2007
Bioinformatics 2007 23(21):2942-2944; doi:10.1093/bioinformatics/btm451
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrowOA All Versions of this Article:
23/21/2942    most recent
btm451v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Google Scholar
Right arrow Articles by Jeck, W. R.
Right arrow Articles by Jones, C. D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Jeck, W. R.
Right arrow Articles by Jones, C. D.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2007 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Extending assembly of short DNA sequences to handle error

William R. Jeck 1,*, Josephine A. Reinhardt 1, David A. Baltrus 1, Matthew T. Hickenbotham 2, Vincent Magrini 2, Elaine R. Mardis 2, Jeffery L. Dangl 1,3 and Corbin D. Jones 1,3

1Department of Biology, University of Carolina—Chapel Hill, Chapel Hill, NC 27599, 2Department of Genetics, Washington University School of Medicine, St. Louis, MO 63108 and 3Carolina Center for Genome Sciences, University of Carolina—Chapel Hill, Chapel Hill, NC 27599, USA

*To whom correspondence should be addressed.


  Abstract

Inexpensive de novo genome sequencing, particularly in organisms with small genomes, is now possible using several new sequencing technologies. Some of these technologies such as that from Illumina's Solexa Sequencing, produce high genomic coverage by generating a very large number of small reads (~30 bp). While prior work shows that partial assembly can be performed by k-mer extension in error-free reads, this algorithm is unsuccessful with the sequencing error rates found in practice. We present VCAKE (Verified Consensus Assembly by K-mer Extension), a modification of simple k-mer extension that overcomes error by using high depth coverage. Though it is a simple modification of a previous approach, we show significant improvements in assembly results on simulated and experimental datasets that include error.

Availability: http://152.2.15.114/~labweb/VCAKE

Contact: william.jeck{at}gmail.com

Associate Editor: Alex Bateman

Received on July 23, 2007; revised on August 21, 2007; accepted on August 24, 2007

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


This article has been cited by other articles:


Home page
 Genome ResHome page
R. A. Holt and S. J.M. Jones
The new paradigm of flow cell sequencing
Genome Res., June 1, 2008; 18(6): 839 - 846.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
J. Butler, I. MacCallum, M. Kleber, I. A. Shlyakhter, M. K. Belmonte, E. S. Lander, C. Nusbaum, and D. B. Jaffe
ALLPATHS: De novo assembly of whole-genome shotgun microreads
Genome Res., May 1, 2008; 18(5): 810 - 820.
[Abstract] [Full Text] [PDF]

Home page
 Genome ResHome page
D. R. Zerbino and E. Birney
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
Genome Res., May 1, 2008; 18(5): 821 - 829.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.