{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T14:56:38Z","timestamp":1775228198933,"version":"3.50.1"},"reference-count":23,"publisher":"Oxford University Press (OUP)","issue":"20","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,10,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>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.<\/jats:p>\n               <jats:p>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.<\/jats:p>\n               <jats:p>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.<\/jats:p>\n               <jats:p>Contact: \u00a0ap@bioinf.spbau.ru<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btv337","type":"journal-article","created":{"date-parts":[[2015,6,4]],"date-time":"2015-06-04T10:15:43Z","timestamp":1433412943000},"page":"3262-3268","source":"Crossref","is-referenced-by-count":72,"title":["Assembling short reads from jumping libraries with large insert sizes"],"prefix":"10.1093","volume":"31","author":[{"given":"Irina","family":"Vasilinetc","sequence":"first","affiliation":[{"name":"1 Algorithmic Biology Lab, St. Petersburg Academic University 194021,"}]},{"given":"Andrey D.","family":"Prjibelski","sequence":"additional","affiliation":[{"name":"1 Algorithmic Biology Lab, St. Petersburg Academic University 194021,"},{"name":"2 Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004,"}]},{"given":"Alexey","family":"Gurevich","sequence":"additional","affiliation":[{"name":"1 Algorithmic Biology Lab, St. Petersburg Academic University 194021,"},{"name":"2 Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004,"}]},{"given":"Anton","family":"Korobeynikov","sequence":"additional","affiliation":[{"name":"1 Algorithmic Biology Lab, St. Petersburg Academic University 194021,"},{"name":"2 Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004,"},{"name":"3 Department of Mathematics and Mechanics, St. Petersburg State University, St. Petersburg, 198504, Russia and"}]},{"given":"Pavel A.","family":"Pevzner","sequence":"additional","affiliation":[{"name":"2 Center for Algorithmic Biotechnology, Institute of Translational Biomedicine, St.Petersburg State University, 199004,"},{"name":"4 Department of Computer Science and Engineering, University of California, San Diego, CA 92093-0404, USA"}]}],"member":"286","published-online":{"date-parts":[[2015,6,3]]},"reference":[{"key":"2023020202314571400_btv337-B1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1089\/cmb.2012.0021","article-title":"SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing","volume":"19","author":"Bankevich","year":"2012","journal-title":"J. Comput. Biol."},{"key":"2023020202314571400_btv337-B2","doi-asserted-by":"crossref","first-page":"1453","DOI":"10.1126\/science.277.5331.1453","article-title":"The complete genome sequence of Escherichia coli K-12","volume":"277","author":"Blattner","year":"1997","journal-title":"Science"},{"key":"2023020202314571400_btv337-B3","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1093\/bioinformatics\/btq683","article-title":"Scaffolding pre-assembled contigs using SSPACE","volume":"27","author":"Boetzer","year":"2011","journal-title":"Bioinformatics"},{"key":"2023020202314571400_btv337-B4","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1089\/cmb.2009.0238","article-title":"Ray: simultaneous assembly of reads from a mix of high-throughput sequencing technologies","volume":"17","author":"Boisvert","year":"2010","journal-title":"J. Comput. Biol."},{"key":"2023020202314571400_btv337-B5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1093\/bioinformatics\/bts399","article-title":"Telescoper: de novo assembly of highly repetitive regions","volume":"28","author":"Bresler","year":"2012","journal-title":"Bioinformatics"},{"key":"2023020202314571400_btv337-B6","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1101\/gr.079053.108","article-title":"De\u00a0novo fragment assembly with short mate-paired reads: does the read length matter?","volume":"19","author":"Chaisson","year":"2009","journal-title":"Genome Res."},{"key":"2023020202314571400_btv337-B7","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1038\/nmeth.2474","article-title":"Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data","volume":"10","author":"Chin","year":"2013","journal-title":"Nat. Methods"},{"key":"2023020202314571400_btv337-B8","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1038\/nbt.1966","article-title":"Efficient de novo assembly of single-cell bacterial genomes from short-read data sets","volume":"29","author":"Chitsaz","year":"2011","journal-title":"Nat. Biotechnol."},{"key":"2023020202314571400_btv337-B9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1186\/1471-2105-11-345","article-title":"SOPRA: Scaffolding algorithm for paired reads via statistical optimization","volume":"11","author":"Dayarian","year":"2010","journal-title":"BMC Bioinformatics"},{"key":"2023020202314571400_btv337-B10","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1093\/bioinformatics\/bts716","article-title":"SCARPA: scaffolding reads with practical algorithms","volume":"29","author":"Donmez","year":"2013","journal-title":"Bioinformatics"},{"key":"2023020202314571400_btv337-B11","doi-asserted-by":"crossref","first-page":"1681","DOI":"10.1089\/cmb.2011.0170","article-title":"Opera: reconstructing optimal genomic scaffolds with high-throughput paired-end sequences","volume":"18","author":"Gao","year":"2011","journal-title":"J. Comput. Biol."},{"key":"2023020202314571400_btv337-B12","doi-asserted-by":"crossref","first-page":"1513","DOI":"10.1073\/pnas.1017351108","article-title":"High-quality draft assemblies of mammalian genomes from massively parallel sequence data","volume":"108","author":"Gnerre","year":"2011","journal-title":"Proc. Natl. Acad. Sci. USA."},{"key":"2023020202314571400_btv337-B13","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1093\/bioinformatics\/btt086","article-title":"QUAST: quality assessment tool for genome assemblies","volume":"29","author":"Gurevich","year":"2013","journal-title":"Bioinformatics"},{"key":"2023020202314571400_btv337-B14","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1101\/gr.097261.109","article-title":"De\u00a0novo assembly of human genomes with massively parallel short read sequencing","volume":"20","author":"Li","year":"2010","journal-title":"Genome Res."},{"key":"2023020202314571400_btv337-B15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/bioinformatics\/bts174","article-title":"IDBA-UD: A de novo assembler for single-cell and metagenomic sequencing data with highly uneven depth","volume":"28","author":"Peng","year":"2012","journal-title":"Bioinformatics"},{"key":"2023020202314571400_btv337-B16","doi-asserted-by":"crossref","first-page":"9748","DOI":"10.1073\/pnas.171285098","article-title":"An Eulerian path approach to DNA fragment assembly","volume":"98","author":"Pevzner","year":"2001","journal-title":"Proc. Natl. Acad. Sci. USA."},{"key":"2023020202314571400_btv337-B17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1101\/gr.1536204","article-title":"Hierarchical scaffolding with Bambus","volume":"14","author":"Pop","year":"2004","journal-title":"Genome Res."},{"key":"2023020202314571400_btv337-B18","doi-asserted-by":"crossref","first-page":"i293","DOI":"10.1093\/bioinformatics\/btu266","article-title":"ExSPAnder: a universal repeat resolver for DNA fragment assembly","volume":"30","author":"Prjibelski","year":"2014","journal-title":"Bioinformatics"},{"key":"2023020202314571400_btv337-B19","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1101\/gr.089532.108","article-title":"ABySS: a parallel assembler for short read sequence data","volume":"19","author":"Simpson","year":"2009","journal-title":"Genome Res."},{"key":"2023020202314571400_btv337-B20","doi-asserted-by":"crossref","first-page":"26","DOI":"10.4056\/sigs.1032748","article-title":"Complete genome sequence of Meiothermus ruber type strain (21T)","volume":"3","author":"Tindall","year":"2010","journal-title":"Stand. Genomic Sci."},{"key":"2023020202314571400_btv337-B21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-33122-0_20","article-title":"From de Bruijn graphs to rectangle graphs for genome assembly","author":"Vyahhi","year":"2012"},{"key":"2023020202314571400_btv337-B22","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1101\/gr.074492.107","article-title":"Velvet: Algorithms for de novo short read assembly using de Bruijn graphs","volume":"18","author":"Zerbino","year":"2008","journal-title":"Genome Res."},{"key":"2023020202314571400_btv337-B23","doi-asserted-by":"crossref","first-page":"e114253","DOI":"10.1371\/journal.pone.0114253","article-title":"PERGA: a paired-end read guided de novo assembler for extending contigs using SVM and look ahead approach","volume":"9","author":"Zhu","year":"2014","journal-title":"PLoS One"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/31\/20\/3262\/49035885\/bioinformatics_31_20_3262.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/31\/20\/3262\/49035885\/bioinformatics_31_20_3262.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T03:50:28Z","timestamp":1675309828000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/31\/20\/3262\/195494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,3]]},"references-count":23,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2015,10,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btv337","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2015,10,15]]},"published":{"date-parts":[[2015,6,3]]}}}