Telescoper: de novo assembly of highly repetitive regions
Open Access
- 3 September 2012
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 28 (18), i311-i317
- https://doi.org/10.1093/bioinformatics/bts399
Abstract
Motivation: With advances in sequencing technology, it has become faster and cheaper to obtain short-read data from which to assemble genomes. Although there has been considerable progress in the field of genome assembly, producing high-quality de novo assemblies from short-reads remains challenging, primarily because of the complex repeat structures found in the genomes of most higher organisms. The telomeric regions of many genomes are particularly difficult to assemble, though much could be gained from the study of these regions, as their evolution has not been fully characterized and they have been linked to aging. Results: In this article, we tackle the problem of assembling highly repetitive regions by developing a novel algorithm that iteratively extends long paths through a series of read-overlap graphs and evaluates them based on a statistical framework. Our algorithm, Telescoper, uses short- and long-insert libraries in an integrated way throughout the assembly process. Results on real and simulated data demonstrate that our approach can effectively resolve much of the complex repeat structures found in the telomeres of yeast genomes, especially when longer long-insert libraries are used. Availability: Telescoper is publicly available for download at sourceforge.net/p/telescoper. Contact: yss@eecs.berkeley.edu Supplementary Information: Supplementary data are available at Bioinformatics online.This publication has 27 references indexed in Scilit:
- De novo assembly and genotyping of variants using colored de Bruijn graphsNature Genetics, 2012
- Efficient de novo assembly of large genomes using compressed data structuresGenome Research, 2011
- GAGE: A critical evaluation of genome assemblies and assembly algorithmsGenome Research, 2011
- Illumina mate-paired DNA sequencing-library preparation using Cre-Lox recombinationNucleic Acids Research, 2011
- Paired de Bruijn Graphs: A Novel Approach for Incorporating Mate Pair Information into Genome AssemblersJournal of Computational Biology, 2011
- Assemblathon 1: A competitive assessment of de novo short read assembly methodsGenome Research, 2011
- High-quality draft assemblies of mammalian genomes from massively parallel sequence dataProceedings of the National Academy of Sciences of the United States of America, 2010
- Limitations of next-generation genome sequence assemblyNature Methods, 2010
- Velvet: Algorithms for de novo short read assembly using de Bruijn graphsGenome Research, 2008
- Proof and evolutionary analysis of ancient genome duplication in the yeast Saccharomyces cerevisiaeNature, 2004