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

Assembling short reads from jumping libraries with large insert sizes.

Bioinformatics (Oxford, England) ·Vol. 31 ·No. 20 ·2015-10-15 ·Pages 3262-8

Vasilinetc I, Prjibelski AD, Gurevich A, Korobeynikov A, Pevzner PA

Abstract

Advances in Next-Generation Sequencing technologies and sample preparation recently enabled generation of high-quality jumping libraries that have a potential to significantly improve short read assemblies. However, assembly algorithms have to catch up with experimental innovations to benefit from them and to produce high-quality assemblies. We present a new algorithm that extends recently described exSPAnder universal repeat resolution approach to enable its applications to several challenging data types, including jumping libraries generated by the recently developed Illumina Nextera Mate Pair protocol. We demonstrate that, with these improvements, bacterial genomes often can be assembled in a few contigs using only a single Nextera Mate Pair library of short reads. Described algorithms are implemented in C++ as a part of SPAdes genome assembler, which is freely available at bioinf.spbau.ru/en/spades. [email protected] Supplementary data are available at Bioinformatics online.

MeSH Terms
Algorithms Gene Library Genome, Bacterial Genomics/methods High-Throughput Nucleotide Sequencing/methods Sequence Analysis, DNA/methods
Authors & Affiliations
5 authors, click to expand affiliations / ORCID
Vasilinetc Irina
Algorithmic Biology Lab, St. Petersburg Academic University 194021.
Prjibelski Andrey D
Algorithmic Biology Lab, St. Petersburg Academic University 194021, Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004.
Gurevich Alexey
Algorithmic Biology Lab, St. Petersburg Academic University 194021, Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004.
Korobeynikov Anton
Algorithmic Biology Lab, St. Petersburg Academic University 194021, Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004, Department of Mathematics and Mechanics, St. Petersburg State University, St. Petersburg, 198504, Russia and.
Pevzner Pavel A
Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004, Department of Computer Science and Engineering, University of California, San Diego, CA 92093-0404, USA.
Article Info
Journal
Bioinformatics (Oxford, England)
Abbr.
Bioinformatics
ISSN
1367-4811
Published
2015-10-15
Epub
2015-00-03
Pages
3262-8
Language
English
Region
England
NLM ID
9808944
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]