{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T02:09:04Z","timestamp":1771639744545,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T00:00:00Z","timestamp":1572393600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec><jats:title>Background<\/jats:title><jats:p>Scaffolding is an important step in genome assembly that orders and orients the contigs produced by assemblers. However, repetitive regions in contigs usually prevent scaffolding from producing accurate results. How to solve the problem of repetitive regions has received a great deal of attention. In the past few years, long reads sequenced by third-generation sequencing technologies (Pacific Biosciences and Oxford Nanopore) have been demonstrated to be useful for sequencing repetitive regions in genomes. Although some stand-alone scaffolding algorithms based on long reads have been presented, scaffolding still requires a new strategy to take full advantage of the characteristics of long reads.<\/jats:p><\/jats:sec><jats:sec><jats:title>Results<\/jats:title><jats:p>Here, we present a new scaffolding algorithm based on long reads and contig classification (SLR). Through the alignment information of long reads and contigs, SLR classifies the contigs into unique contigs and ambiguous contigs for addressing the problem of repetitive regions. Next, SLR uses only unique contigs to produce draft scaffolds. Then, SLR inserts the ambiguous contigs into the draft scaffolds and produces the final scaffolds. We compare SLR to three popular scaffolding tools by using long read datasets sequenced with Pacific Biosciences and Oxford Nanopore technologies. The experimental results show that SLR can produce better results in terms of accuracy and completeness. The open-source code of SLR is available at https:\/\/github.com\/luojunwei\/SLR.<\/jats:p><\/jats:sec><jats:sec><jats:title>Conclusion<\/jats:title><jats:p>In this paper, we describes SLR, which is designed to scaffold contigs using long reads. We conclude that SLR can improve the completeness of genome assembly.<\/jats:p><\/jats:sec>","DOI":"10.1186\/s12859-019-3114-9","type":"journal-article","created":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T20:44:43Z","timestamp":1572468283000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["SLR: a scaffolding algorithm based on long reads and contig classification"],"prefix":"10.1186","volume":"20","author":[{"given":"Junwei","family":"Luo","sequence":"first","affiliation":[]},{"given":"Mengna","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Ranran","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xiaohong","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Huimin","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Chaokun","family":"Yan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,30]]},"reference":[{"issue":"6","key":"3114_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1038\/s41576-018-0003-4","volume":"19","author":"FJ Sedlazeck","year":"2018","unstructured":"Sedlazeck FJ, Lee H, Darby CA, Schatz MC. Piercing the dark matter: bioinformatics of long-range sequencing and mapping. Nature Rev Genet. 2018; 19(6):329.","journal-title":"Nature Rev Genet"},{"issue":"6","key":"3114_CR2","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1093\/bioinformatics\/btu762","volume":"31","author":"L Junwei","year":"2015","unstructured":"Junwei L, Jianxin W, Zhen Z, Fang-Xiang W, Min L, Yi P. Epga: de novo assembly using the distributions of reads and insert size. Bioinformatics. 2015; 31(6):825\u201333.","journal-title":"Bioinformatics"},{"issue":"24","key":"3114_CR3","doi-asserted-by":"crossref","first-page":"3988","DOI":"10.1093\/bioinformatics\/btv487","volume":"31","author":"J Luo","year":"2015","unstructured":"Luo J, Wang J, Li W, Zhang Z, Wu FX, Li M, Pan Y. Epga2: memory-efficient de novo assembler. Bioinformatics. 2015; 31(24):3988\u201390.","journal-title":"Bioinformatics"},{"issue":"3","key":"3114_CR4","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1186\/gb-2014-15-3-r42","volume":"15","author":"M Hunt","year":"2014","unstructured":"Hunt M, Newbold C, Berriman M, Otto TD. A comprehensive evaluation of assembly scaffolding tools. Genome Biol,15,3(2014-03-03). 2014; 15(3):42.","journal-title":"Genome Biol,15,3(2014-03-03)"},{"issue":"11","key":"3114_CR5","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1089\/cmb.2011.0170","volume":"18","author":"S Gao","year":"2011","unstructured":"Gao S, Sung WK, Nagarajan N. Opera: Reconstructing optimal genomic scaffolds with high-throughput paired-end sequences. J Comput Biol. 2011; 18(11):1681\u201391.","journal-title":"J Comput Biol"},{"issue":"4","key":"3114_CR6","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1093\/bioinformatics\/btq683","volume":"27","author":"B Marten","year":"2011","unstructured":"Marten B, Christiaan V H, Hans J J, Derek B, Walter P. Scaffolding pre-assembled contigs using sspace. Bioinformatics. 2011; 27(4):578\u20139.","journal-title":"Bioinformatics"},{"issue":"1","key":"3114_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1186\/1471-2105-15-281","volume":"15","author":"K Sahlin","year":"2014","unstructured":"Sahlin K, Vezzi F, Nystedt B, Lundeberg J, Arvestad L. Besst - efficient scaffolding of large fragmented assemblies. Bmc Bioinformatics. 2014; 15(1):281.","journal-title":"Bmc Bioinformatics"},{"issue":"16","key":"3114_CR8","doi-asserted-by":"publisher","first-page":"2632","DOI":"10.1093\/bioinformatics\/btv211","volume":"31","author":"I Mandric","year":"2015","unstructured":"Mandric I, Zelikovsky A. Scaffmatch: Scaffolding algorithm based on maximum weight matching. Bioinformatics. 2015; 31(16):2632\u20138.","journal-title":"Bioinformatics"},{"issue":"4","key":"3114_CR9","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1093\/bioinformatics\/bts716","volume":"29","author":"D Nilgun","year":"2013","unstructured":"Nilgun D, Michael B. Scarpa: scaffolding reads with practical algorithms. Bioinformatics. 2013; 29(4):428\u201334.","journal-title":"Bioinformatics"},{"issue":"1","key":"3114_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1093\/bioinformatics\/btv548","volume":"32","author":"PM Bodily","year":"2016","unstructured":"Bodily PM, Fujimoto MS, Snell Q, Dan V, Clement MJ. Scaffoldscaffolder: solving contig orientation via bidirected to directed graph reduction. Bioinformatics. 2016; 32(1):17.","journal-title":"Bioinformatics"},{"issue":"2","key":"3114_CR11","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1093\/bioinformatics\/btw597","volume":"33","author":"J Luo","year":"2016","unstructured":"Luo J, Wang J, Zhang Z, Li M, Wu FX. Boss: a novel scaffolding algorithm based on an optimized scaffold graph. Bioinformatics. 2016; 33(2):169.","journal-title":"Bioinformatics"},{"issue":"1","key":"3114_CR12","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1186\/1471-2105-15-211","volume":"15","author":"M Boetzer","year":"2014","unstructured":"Boetzer M, Pirovano W. Sspace-longread: scaffolding bacterial draft genomes using long read sequence information. Bmc Bioinformatics. 2014; 15(1):211\u20131.","journal-title":"Bmc Bioinformatics"},{"issue":"1","key":"3114_CR13","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1186\/1471-2105-13-238","volume":"13","author":"MJ Chaisson","year":"2012","unstructured":"Chaisson MJ, Tesler G. Mapping single molecule sequencing reads using basic local alignment with successive refinement (blasr): application and theory. Bmc Bioinformatics. 2012; 13(1):238.","journal-title":"Bmc Bioinformatics"},{"issue":"1","key":"3114_CR14","first-page":"1","volume":"4","author":"RL Warren","year":"2015","unstructured":"Warren RL, Yang C, Vandervalk BP, Behsaz B, Lagman A, Jones SJM, Birol I. Links: Scalable, alignment-free scaffolding of draft genomes with long reads. GigaScience,4,1(2015-08-04). 2015; 4(1):1\u201311.","journal-title":"GigaScience,4,1(2015-08-04)"},{"issue":"10","key":"3114_CR15","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1186\/s12864-017-4271-8","volume":"18","author":"S Zhu","year":"2017","unstructured":"Zhu S, Chen DZ, Emrich SJ. Single molecule sequencing-guided scaffolding and correction of draft assemblies. BMC genomics. 2017; 18(10):879.","journal-title":"BMC genomics"},{"issue":"2","key":"3114_CR16","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/gb-2004-5-2-r12","volume":"5","author":"S Kurtz","year":"2004","unstructured":"Kurtz S, Phillippy A, Delcher AL, Smoot M, Shumway M, Antonescu C, Salzberg SL. Versatile and open software for comparing large genomes. Genome Biol. 2004; 5(2):12.","journal-title":"Genome Biol"},{"issue":"7","key":"3114_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.21105\/joss.00116","volume":"1","author":"RL Warren","year":"2016","unstructured":"Warren RL. Rails and cobbler: Scaffolding and automated finishing of draft genomes using long dna sequences. J Open Source Softw. 2016; 1(7):116.","journal-title":"J Open Source Softw"},{"issue":"4","key":"3114_CR18","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1093\/bioinformatics\/btl629","volume":"23","author":"W Ren\u00e9 L","year":"2007","unstructured":"Ren\u00e9 L W, Granger G S, Steven J M J, Robert A H. Assembling millions of short dna sequences using ssake. Bioinformatics. 2007; 23(4):500\u20131.","journal-title":"Bioinformatics"},{"key":"3114_CR19","doi-asserted-by":"publisher","first-page":"14515","DOI":"10.1038\/ncomms14515","volume":"8","author":"MD Cao","year":"2017","unstructured":"Cao MD, Nguyen SH, Ganesamoorthy D, Elliott AG, Cooper MA, Coin LJM. Scaffolding and completing genome assemblies in real-time with nanopore sequencing. Nature Commun. 2017; 8:14515.","journal-title":"Nature Commun"},{"issue":"5","key":"3114_CR20","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1101\/gr.214874.116","volume":"27","author":"NI Weisenfeld","year":"2017","unstructured":"Weisenfeld NI, Kumar V, Shah P, Church DM, Jaffe DB. Direct determination of diploid genome sequences. Genome Res. 2017; 27(5):757\u201367.","journal-title":"Genome Res"},{"issue":"12","key":"3114_CR21","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1093\/bioinformatics\/btw267","volume":"32","author":"V Kuleshov","year":"2016","unstructured":"Kuleshov V, Snyder MP, Batzoglou S. Genome assembly from synthetic long read clouds. Bioinformatics. 2016; 32(12):216\u201324.","journal-title":"Bioinformatics"},{"issue":"5","key":"3114_CR22","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1093\/bioinformatics\/btx675","volume":"34","author":"S Yeo","year":"2018","unstructured":"Yeo S, Coombe L, Chu J, Warren RL, Birol I. Arcs: Scaffolding genome drafts with linked reads. Bioinformatics. 2018; 34(5):725\u201331.","journal-title":"Bioinformatics"},{"issue":"12","key":"3114_CR23","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1101\/gr.178319.114","volume":"24","author":"A Andrew","year":"2014","unstructured":"Andrew A, Kitzman JO, Burton JN, Riza D, Akash K, Lena C, Mostafa R, Sasan A, Kevin LG, Steemers FJ. In vitro, long-range sequence information for de novo genome assembly via transposase contiguity. Genome Res. 2014; 24(12):2041\u20139.","journal-title":"Genome Res"},{"issue":"8","key":"3114_CR24","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1093\/bioinformatics\/btt086","volume":"29","author":"A Gurevich","year":"2013","unstructured":"Gurevich A, Saveliev V, Vyahhi N, Tesler G. Quast: quality assessment tool for genome assemblies. Bioinformatics. 2013; 29(8):1072\u20135.","journal-title":"Bioinformatics"},{"key":"3114_CR25","unstructured":"Li H. Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM. 2013. arXiv preprint arXiv:1303.3997."},{"issue":"15","key":"3114_CR26","doi-asserted-by":"publisher","first-page":"2530","DOI":"10.1093\/bioinformatics\/bty131","volume":"34","author":"I Mandric","year":"2017","unstructured":"Mandric I, Knyazev S, Zelikovsky A. Repeat aware evaluation of scaffolding tools. Bioinformatics. 2017; 34(15):2530\u20137.","journal-title":"Bioinformatics"},{"issue":"12","key":"3114_CR27","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1093\/bioinformatics\/btr174","volume":"27","author":"DW Barnett","year":"2011","unstructured":"Barnett DW, Garrison EK, Quinlan AR, Stromberg MP, Marth GT. Bamtools: a c++ api and toolkit for analyzing and managing bam files. Bioinformatics. 2011; 27(12):1691\u20132.","journal-title":"Bioinformatics"},{"key":"3114_CR28","unstructured":"Berkelaar M, Eikland K, Notebaert P. lp_solve 5.5, open source (mixed-integer) linear programming system. Software. May 1 2004."},{"key":"3114_CR29","doi-asserted-by":"crossref","unstructured":"Lee H, Gurtowski J, Yoo S, Marcus S, Mccombie WR, Schatz M. Error correction and assembly complexity of single molecule sequencing reads. Biorxiv. 2014:006395.","DOI":"10.1101\/006395"},{"issue":"11","key":"3114_CR30","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1101\/gr.191395.115","volume":"25","author":"S Goodwin","year":"2015","unstructured":"Goodwin S, Gurtowski J, Ethe-Sayers S, Deshpande P, Schatz MC, Mccombie WR. Oxford nanopore sequencing, hybrid error correction, and de novo assembly of a eukaryotic genome. Genome Res. 2015; 25(11):1750.","journal-title":"Genome Res"},{"issue":"1","key":"3114_CR31","doi-asserted-by":"publisher","first-page":"giy157","DOI":"10.1093\/gigascience\/giy157","volume":"8","author":"G-C Xu","year":"2019","unstructured":"Xu G-C, Xu T-J, Zhu R, Zhang Y, Li S-Q, Wang H-W, Li J-T. Lr_gapcloser: a tiling path-based gap closer that uses long reads to complete genome assembly. GigaScience. 2019; 8(1):giy157.","journal-title":"GigaScience"}],"updated-by":[{"DOI":"10.1186\/s12859-020-3362-8","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T00:00:00Z","timestamp":1581292800000}}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-3114-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-019-3114-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-019-3114-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T08:32:38Z","timestamp":1695371558000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-019-3114-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,30]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3114"],"URL":"https:\/\/doi.org\/10.1186\/s12859-019-3114-9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,30]]},"assertion":[{"value":"19 December 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2020","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Following publication of the original article [1], the author reported that there is an error in the original article.","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"539"}}