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.

• PMID: 22962446
• DOI full text
• PMC full text
• PubMed

Reference Type

Journal Article | Research Support, U.S. Gov't, Non-P.H.S.

Authors

Bresler M, Sheehan S, Chan AH, Song YS

Primary Lit For

Additional Lit For

Review For