Assembly complexity of prokaryotic genomes using short reads

krobison · 01-20-2010, 08:49 AM

Assembly complexity of prokaryotic genomes using short reads
Carl Kingsford , Michael C Schatz and Mihai Pop

Abstract (provisional)

Background
De Bruijn graphs are a theoretical framework underlying several modern genome assembly programs, especially those that deal with very short reads. We describe an application of de Bruijn graphs to analyze the global repeat structure of prokaryotic genomes.

Results
We provide the first survey of the repeat structure of a large number of genomes. The analysis gives an upper-bound on the performance of genome assemblers for de novo reconstruction of genomes across a wide range of read lengths. Further, we demonstrate that the majority of genes in prokaryotic genomes can be reconstructed uniquely using very short reads even if the genomes themselves cannot. The non-reconstructible genes are overwhelmingly related to mobile elements (transposons, IS elements, and prophages).

Conclusions
Our results improve upon previous studies on the feasibility of assembly with short reads and provide a comprehensive benchmark against which to compare the performance of the short-read assemblers currently being developed.

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
PubMed: Parallelized short read assembly of large genomes using de Bruijn graphs.	Newsbot!	Literature Watch	0	12-30-2011 03:00 AM
Create the best prokaryotic genome assembly: Combining different methods	JurgenP	Bioinformatics	4	02-27-2010 11:46 AM
De novo assembly of human genomes with massively parallel short read sequencing	dan	Literature Watch	0	12-21-2009 05:40 AM
PubMed: De novo assembly of human genomes with massively parallel short read sequenci	Newsbot!	Literature Watch	0	12-19-2009 03:13 AM
PubMed: High quality draft sequences for prokaryotic genomes using a mix of new seque	Newsbot!	Literature Watch	0	12-18-2008 06:01 AM

01-20-2010, 08:49 AM	#1
krobison Senior Member Location: Boston area Join Date: Nov 2007 Posts: 747	Assembly complexity of prokaryotic genomes using short reads Assembly complexity of prokaryotic genomes using short reads Carl Kingsford , Michael C Schatz and Mihai Pop Abstract (provisional) Background De Bruijn graphs are a theoretical framework underlying several modern genome assembly programs, especially those that deal with very short reads. We describe an application of de Bruijn graphs to analyze the global repeat structure of prokaryotic genomes. Results We provide the first survey of the repeat structure of a large number of genomes. The analysis gives an upper-bound on the performance of genome assemblers for de novo reconstruction of genomes across a wide range of read lengths. Further, we demonstrate that the majority of genes in prokaryotic genomes can be reconstructed uniquely using very short reads even if the genomes themselves cannot. The non-reconstructible genes are overwhelmingly related to mobile elements (transposons, IS elements, and prophages). Conclusions Our results improve upon previous studies on the feasibility of assembly with short reads and provide a comprehensive benchmark against which to compare the performance of the short-read assemblers currently being developed.