Irina Vasilinetc1, Andrey D Prjibelski2, Alexey Gurevich2, Anton Korobeynikov3, Pavel A Pevzner4. 1. Algorithmic Biology Lab, St. Petersburg Academic University 194021. 2. Algorithmic Biology Lab, St. Petersburg Academic University 194021, Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004. 3. 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. 4. 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.
Abstract
MOTIVATION: 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. RESULTS: 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. AVAILABILITY AND IMPLEMENTATION: Described algorithms are implemented in C++ as a part of SPAdes genome assembler, which is freely available at bioinf.spbau.ru/en/spades. CONTACT: ap@bioinf.spbau.ru SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
MOTIVATION: 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. RESULTS: 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. AVAILABILITY AND IMPLEMENTATION: Described algorithms are implemented in C++ as a part of SPAdes genome assembler, which is freely available at bioinf.spbau.ru/en/spades. CONTACT: ap@bioinf.spbau.ru SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Authors: Scott A Cunningham; Nicholas Chia; Patricio R Jeraldo; Daniel J Quest; Julie A Johnson; Dave J Boxrud; Angela J Taylor; Jun Chen; Gregory D Jenkins; Travis M Drucker; Heidi Nelson; Robin Patel Journal: J Clin Microbiol Date: 2017-04-12 Impact factor: 5.948
Authors: Yu Lin; Jeffrey Yuan; Mikhail Kolmogorov; Max W Shen; Mark Chaisson; Pavel A Pevzner Journal: Proc Natl Acad Sci U S A Date: 2016-12-12 Impact factor: 11.205
Authors: Miriam R Fernandes; John A McCulloch; Marco A Vianello; Quézia Moura; Paula J Pérez-Chaparro; Fernanda Esposito; Luciana Sartori; Milena Dropa; Maria H Matté; Débora P A Lira; Elsa M Mamizuka; Nilton Lincopan Journal: Antimicrob Agents Chemother Date: 2016-09-23 Impact factor: 5.191
Authors: Jorge A Ramírez-Tejero; Carmen Gómez-Lama Cabanás; Antonio Valverde-Corredor; Jesús Mercado-Blanco; Francisco Luque Journal: Int J Mol Sci Date: 2020-07-22 Impact factor: 5.923