Home LiteratureArticle Details
PMID: 22962446 Published · ppublish English Journal Article Research Support, U.S. Gov't, Non-P.H.S.

Telescoper: de novo assembly of highly repetitive regions.

Bioinformatics (Oxford, England) ·Vol. 28 ·No. 18 ·2012-09-15 ·Pages i311-i317

Bresler M, Sheehan S, Chan AH, Song YS

Abstract

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. 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. Telescoper is publicly available for download at sourceforge.net/p/telescoper. [email protected] Supplementary data are available at Bioinformatics online.

MeSH Terms
Algorithms DNA/chemistry Genome Genomics/methods High-Throughput Nucleotide Sequencing/methods Repetitive Sequences, Nucleic Acid Saccharomyces cerevisiae/genetics Sequence Analysis, DNA/methods
Chemicals
DNA
Authors & Affiliations
4 authors, click to expand affiliations / ORCID
Bresler Ma'ayan
Department of EECS, University of California, Berkeley, CA 94720, USA.
Sheehan Sara
Chan Andrew H
Song Yun S
References (26)
26 references, click to expand
  1. Sequence and structural variation in a human genome uncovered by short-read, massively parallel ligation sequencing using two-base encoding.
    Genome Res. 2009 Sep;19(9):1527-41 PMID: 19546169
  2. PE-Assembler: de novo assembler using short paired-end reads.
    Bioinformatics. 2011 Jan 15;27(2):167-74 PMID: 21149345
  3. Efficient de novo assembly of large genomes using compressed data structures.
    Genome Res. 2012 Mar;22(3):549-56 PMID: 22156294
  4. Telomeres and their control.
    Annu Rev Genet. 2000;34:331-358 PMID: 11092831
  5. Generation of long insert pairs using a Cre-LoxP Inverse PCR approach.
    PLoS One. 2012;7(1):e29437 PMID: 22253722
  6. Velvet: algorithms for de novo short read assembly using de Bruijn graphs.
    Genome Res. 2008 May;18(5):821-9 PMID: 18349386
  7. ALLPATHS 2: small genomes assembled accurately and with high continuity from short paired reads.
    Genome Biol. 2009;10(10):R103 PMID: 19796385
  8. Limitations of next-generation genome sequence assembly.
    Nat Methods. 2011 Jan;8(1):61-5 PMID: 21102452
  9. High-quality draft assemblies of mammalian genomes from massively parallel sequence data.
    Proc Natl Acad Sci U S A. 2011 Jan 25;108(4):1513-8 PMID: 21187386
  10. Human genome sequencing using unchained base reads on self-assembling DNA nanoarrays.
    Science. 2010 Jan 1;327(5961):78-81 PMID: 19892942
  11. ABySS: a parallel assembler for short read sequence data.
    Genome Res. 2009 Jun;19(6):1117-23 PMID: 19251739
  12. A whole-genome assembly of Drosophila.
    Science. 2000 Mar 24;287(5461):2196-204 PMID: 10731133
  13. Paired de bruijn graphs: a novel approach for incorporating mate pair information into genome assemblers.
    J Comput Biol. 2011 Nov;18(11):1625-34 PMID: 21999285
  14. Proof and evolutionary analysis of ancient genome duplication in the yeast Saccharomyces cerevisiae.
    Nature. 2004 Apr 8;428(6983):617-24 PMID: 15004568
  15. Assembly of non-unique insertion content using next-generation sequencing.
    BMC Bioinformatics. 2011;12 Suppl 6:S3 PMID: 21989261
  16. Illumina mate-paired DNA sequencing-library preparation using Cre-Lox recombination.
    Nucleic Acids Res. 2012 Feb;40(3):e24 PMID: 22127871
  17. De novo assembly of human genomes with massively parallel short read sequencing.
    Genome Res. 2010 Feb;20(2):265-72 PMID: 20019144
  18. Assemblathon 1: a competitive assessment of de novo short read assembly methods.
    Genome Res. 2011 Dec;21(12):2224-41 PMID: 21926179
  19. Genome sequencing in microfabricated high-density picolitre reactors.
    Nature. 2005 Sep 15;437(7057):376-80 PMID: 16056220
  20. Fast algorithms for large-scale genome alignment and comparison.
    Nucleic Acids Res. 2002 Jun 1;30(11):2478-83 PMID: 12034836
  21. An Eulerian path approach to DNA fragment assembly.
    Proc Natl Acad Sci U S A. 2001 Aug 14;98(17):9748-53 PMID: 11504945
  22. Single-molecule DNA sequencing of a viral genome.
    Science. 2008 Apr 4;320(5872):106-9 PMID: 18388294
  23. De novo assembly and genotyping of variants using colored de Bruijn graphs.
    Nat Genet. 2012 Jan 08;44(2):226-32 PMID: 22231483
  24. GAGE: A critical evaluation of genome assemblies and assembly algorithms.
    Genome Res. 2012 Mar;22(3):557-67 PMID: 22147368
  25. De novo fragment assembly with short mate-paired reads: Does the read length matter?
    Genome Res. 2009 Feb;19(2):336-46 PMID: 19056694
  26. An integrated semiconductor device enabling non-optical genome sequencing.
    Nature. 2011 Jul 20;475(7356):348-52 PMID: 21776081
Article Info
Journal
Bioinformatics (Oxford, England)
Abbr.
Bioinformatics
ISSN
1367-4811
Published
2012-09-15
Pages
i311-i317
Language
English
Region
England
NLM ID
9808944
PMCID
PMC3436826
Subset
IM
Analysis Services
Analysis Services

Contact

No. 2 Wenbo Road, Zhangqiu District, Jinan, Shandong

Qilu Normal University · Genelibs Bioinformatics Lab

750 Shunhua Rd, Jinan

2F, Bldg F, University Science Park

Tel: 0531-88819269

WeChat Official Account

Follow our WeChat subscription account for real-time updates and the latest in medical and biological research.


Business Email

E-mail: [email protected]