Home LiteratureArticle Details
PMID: 24931996 Published · ppublish English Journal Article Research Support, N.I.H., Extramural Research Support, Non-U.S. Gov't

ExSPAnder: a universal repeat resolver for DNA fragment assembly.

Bioinformatics (Oxford, England) ·Vol. 30 ·No. 12 ·2014-06-15 ·Pages i293-301

Prjibelski AD, Vasilinetc I, Bankevich A, Gurevich A, Krivosheeva T, Nurk S, Pham S, Korobeynikov A, Lapidus A, Pevzner PA

Abstract

Next-generation sequencing (NGS) technologies have raised a challenging de novo genome assembly problem that is further amplified in recently emerged single-cell sequencing projects. While various NGS assemblers can use information from several libraries of read-pairs, most of them were originally developed for a single library and do not fully benefit from multiple libraries. Moreover, most assemblers assume uniform read coverage, condition that does not hold for single-cell projects where utilization of read-pairs is even more challenging. We have developed an exSPAnder algorithm that accurately resolves repeats in the case of both single and multiple libraries of read-pairs in both standard and single-cell assembly projects. http://bioinf.spbau.ru/en/spades

MeSH Terms
Actinomycetales/genetics Algorithms DNA/chemistry Gene Library Genome, Bacterial High-Throughput Nucleotide Sequencing/methods Humans Repetitive Sequences, Nucleic Acid Sequence Analysis, DNA/methods Staphylococcus aureus/genetics
Chemicals
DNA
Authors & Affiliations
10 authors, click to expand affiliations / ORCID
Prjibelski Andrey D
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Vasilinetc Irina
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Bankevich Anton
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Gurevich Alexey
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Krivosheeva Tatiana
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Nurk Sergey
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Pham Son
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Korobeynikov Anton
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USAAlgorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Lapidus Alla
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USAAlgorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
Pevzner Pavel A
Algorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USAAlgorithmic Biology Lab, St. Petersburg Academic University, St. Petersburg, Russia, Department of Mathematics and Mechanics, Theodosius Dobzhansky Center for Genome Bioinformatics, St. Petersburg State University, St. Petersburg, Russia and Department of Computer Science and Engineering, University of California, San Diego, USA.
References (19)
19 references, click to expand
  1. Pathset graphs: a novel approach for comprehensive utilization of paired reads in genome assembly.
    J Comput Biol. 2013 Apr;20(4):359-71 PMID: 22803627
  2. Telescoper: de novo assembly of highly repetitive regions.
    Bioinformatics. 2012 Sep 15;28(18):i311-i317 PMID: 22962446
  3. Efficient de novo assembly of single-cell bacterial genomes from short-read data sets.
    Nat Biotechnol. 2011 Sep 18;29(10):915-21 PMID: 21926975
  4. 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
  5. Velvet: algorithms for de novo short read assembly using de Bruijn graphs.
    Genome Res. 2008 May;18(5):821-9 PMID: 18349386
  6. De novo assembly of human genomes with massively parallel short read sequencing.
    Genome Res. 2010 Feb;20(2):265-72 PMID: 20019144
  7. SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing.
    J Comput Biol. 2012 May;19(5):455-77 PMID: 22506599
  8. ABySS: a parallel assembler for short read sequence data.
    Genome Res. 2009 Jun;19(6):1117-23 PMID: 19251739
  9. Ray: simultaneous assembly of reads from a mix of high-throughput sequencing technologies.
    J Comput Biol. 2010 Nov;17(11):1519-33 PMID: 20958248
  10. IDBA-UD: a de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth.
    Bioinformatics. 2012 Jun 1;28(11):1420-8 PMID: 22495754
  11. Fast gapped-read alignment with Bowtie 2.
    Nat Methods. 2012 Mar 04;9(4):357-9 PMID: 22388286
  12. An Eulerian path approach to DNA fragment assembly.
    Proc Natl Acad Sci U S A. 2001 Aug 14;98(17):9748-53 PMID: 11504945
  13. Complete genome sequence of Brachybacterium faecium type strain (Schefferle 6-10).
    Stand Genomic Sci. 2009 Jul 20;1(1):3-11 PMID: 21304631
  14. QUAST: quality assessment tool for genome assemblies.
    Bioinformatics. 2013 Apr 15;29(8):1072-5 PMID: 23422339
  15. 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
  16. Complete genome sequence of USA300, an epidemic clone of community-acquired meticillin-resistant Staphylococcus aureus.
    Lancet. 2006 Mar 4;367(9512):731-9 PMID: 16517273
  17. Assembling single-cell genomes and mini-metagenomes from chimeric MDA products.
    J Comput Biol. 2013 Oct;20(10):714-37 PMID: 24093227
  18. How to apply de Bruijn graphs to genome assembly.
    Nat Biotechnol. 2011 Nov 08;29(11):987-91 PMID: 22068540
  19. ALLPATHS: de novo assembly of whole-genome shotgun microreads.
    Genome Res. 2008 May;18(5):810-20 PMID: 18340039
Article Info
Journal
Bioinformatics (Oxford, England)
Abbr.
Bioinformatics
ISSN
1367-4811
DOI
10.1093/bioinformatics/btu266
Published
2014-06-15
Pages
i293-301
Language
English
Region
England
NLM ID
9808944
PMCID
PMC4058921
Subset
IM
Grants
NCRR NIH HHS · P41 RR024851 · United States
NCRR NIH HHS · 3P41RR024851-02S1 · United States
External Links
PubMed source DOI: 10.1093/bioinformatics/btu266 PMC Full Text View journal details
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]

Copyright © 2026.Genelibs Jinan Honghui Biotechnology Co., Ltd. 鲁ICP备20007159号-2