{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:45:20Z","timestamp":1740185120491,"version":"3.37.3"},"reference-count":28,"publisher":"Oxford University Press (OUP)","issue":"10","license":[{"start":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T00:00:00Z","timestamp":1648166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["32170679","11871462","91530105"],"award-info":[{"award-number":["32170679","11871462","91530105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Center for Mathematics and Interdisciplinary Sciences of the CAS"},{"name":"Key Laboratory of Systems and Control of the CAS"},{"name":"Strategic Priority Research Program of the Chinese Academy of Sciences","award":["XDB13040600"],"award-info":[{"award-number":["XDB13040600"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,13]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Motivation<\/jats:title>\n                  <jats:p>Crucial to the correctness of a genome assembly is the accuracy of the underlying scaffolds that specify the orders and orientations of contigs together with the gap distances between contigs. The current methods construct scaffolds based on the alignments of \u2018linking\u2019 reads against contigs. We found that some \u2018optimal\u2019 alignments are mistaken due to factors such as the contig boundary effect, particularly in the presence of repeats. Occasionally, the incorrect alignments can even overwhelm the correct ones. The detection of the incorrect linking information is challenging in any existing methods.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Results<\/jats:title>\n                  <jats:p>In this study, we present a novel scaffolding method RegScaf. It first examines the distribution of distances between contigs from read alignment by the kernel density. When multiple modes are shown in a density, orientation-supported links are grouped into clusters, each of which defines a linking distance corresponding to a mode. The linear model parameterizes contigs by their positions on the genome; then each linking distance between a pair of contigs is taken as an observation on the difference of their positions. The parameters are estimated by minimizing a global loss function, which is a version of trimmed sum of squares. The least trimmed squares estimate has such a high breakdown value that it can automatically remove the mistaken linking distances. The results on both synthetic and real datasets demonstrate that RegScaf outperforms some popular scaffolders, especially in the accuracy of gap estimates by substantially reducing extremely abnormal errors. Its strength in resolving repeat regions is exemplified by a real case. Its adaptability to large genomes and TGS long reads is validated as well.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>RegScaf is publicly available at https:\/\/github.com\/lemontealala\/RegScaf.git.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Supplementary information<\/jats:title>\n                  <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1093\/bioinformatics\/btac174","type":"journal-article","created":{"date-parts":[[2022,3,23]],"date-time":"2022-03-23T12:20:41Z","timestamp":1648038041000},"page":"2675-2682","source":"Crossref","is-referenced-by-count":2,"title":["RegScaf: a regression approach to scaffolding"],"prefix":"10.1093","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8344-0241","authenticated-orcid":false,"given":"Mengtian","family":"Li","sequence":"first","affiliation":[{"name":"National Center of Mathematics and Interdisciplinary Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences , Beijing 100190, China"},{"name":"University of Chinese Academy of Sciences , Beijing 100049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6571-1079","authenticated-orcid":false,"given":"Lei M","family":"Li","sequence":"additional","affiliation":[{"name":"National Center of Mathematics and Interdisciplinary Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences , Beijing 100190, China"},{"name":"University of Chinese Academy of Sciences , Beijing 100049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"2023020109084240800_btac174-B1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1207\/s15516709cog0901_7","article-title":"A learning algorithm for Boltzmann Machines","volume":"9","author":"Ackley","year":"1985","journal-title":"Cognitive Sci"},{"key":"2023020109084240800_btac174-B2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1186\/1471-2105-15-211","article-title":"SSPACE-LongRead: scaffolding bacterial draft genomes using long read sequence information","volume":"15","author":"Boetzer","year":"2014","journal-title":"BMC Bioinformatics"},{"key":"2023020109084240800_btac174-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":"2023020109084240800_btac174-B4","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1101\/gr.7337908","article-title":"ALLPATHS: de novo assembly of whole-genome shotgun microreads","volume":"18","author":"Butler","year":"2008","journal-title":"Genome Res"},{"key":"2023020109084240800_btac174-B5","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1186\/1471-2105-13-238","article-title":"Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory","volume":"13","author":"Chaisson","year":"2012","journal-title":"BMC Bioinformatics"},{"key":"2023020109084240800_btac174-B6","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1089\/cmb.2013.0111","article-title":"SEME: a fast mapper of illumina sequencing reads with statistical evaluation","volume":"20","author":"Chen","year":"2013","journal-title":"J. Comput. Biol"},{"key":"2023020109084240800_btac174-B7","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":"2023020109084240800_btac174-B8","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":"2023020109084240800_btac174-B9","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1186\/s13059-016-0951-y","article-title":"OPERA-LG: efficient and exact scaffolding of large, repeat-rich eukaryotic genomes with performance guarantees","volume":"17","author":"Gao","year":"2016","journal-title":"Genome Biol"},{"key":"2023020109084240800_btac174-B10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979","edition":"1st edn."},{"key":"2023020109084240800_btac174-B12","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1093\/bioinformatics\/btr708","article-title":"ART: a next-generation sequencing read simulator","volume":"28","author":"Huang","year":"2012","journal-title":"Bioinformatics"},{"key":"2023020109084240800_btac174-B13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970036","volume-title":"Robust Statistical Procedures","author":"Huber","year":"1996"},{"key":"2023020109084240800_btac174-B14","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/585265.585267","article-title":"The greedy path-merging algorithm for contig scaffolding","volume":"49","author":"Huson","year":"2002","journal-title":"J. ACM"},{"key":"2023020109084240800_btac174-B15","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/j.csda.2004.04.003","article-title":"An algorithm for computing exact least-trimmed squares estimate of simple linear regression with constraints","volume":"48","author":"Li","year":"2005","journal-title":"Comput. Stat. Data Anal"},{"key":"2023020109084240800_btac174-B16","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1186\/2047-217X-1-18","article-title":"SOAPdenovo2: an empirically improved memory-efficient short-read de novo assembler","volume":"1","author":"Luo","year":"2012","journal-title":"GigaScience"},{"key":"2023020109084240800_btac174-B17","first-page":"2530","article-title":"Repeat-aware evaluation of scaffolding tools","author":"Mandric","year":"2018"},{"key":"2023020109084240800_btac174-B55742871","doi-asserted-by":"crossref","first-page":"i142","DOI":"10.1093\/bioinformatics\/bty266","article-title":"Versatile genome assembly evaluation with QUAST-LG","volume":"34","author":"Mikheenko","year":"2018","journal-title":"Bioinformatics (Oxford, England)"},{"key":"2023020109084240800_btac174-B18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12864-019-6337-2","article-title":"LRScaf: improving draft genomes using long noisy reads","volume":"20","author":"Qin","year":"2019","journal-title":"BMC Genomics"},{"key":"2023020109084240800_btac174-B19","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1186\/gb-2013-14-6-405","article-title":"The advantages of SMRT sequencing","volume":"14","author":"Roberts","year":"2013","journal-title":"Genome Biol"},{"volume-title":"Robust Regression and Outlier Detection","year":"2003","author":"Rousseeuw","key":"2023020109084240800_btac174-B20"},{"key":"2023020109084240800_btac174-B21","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1093\/bioinformatics\/bts441","article-title":"Improved gap size estimation for scaffolding algorithms","volume":"28","author":"Sahlin","year":"2012","journal-title":"Bioinformatics"},{"key":"2023020109084240800_btac174-B22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1186\/1471-2105-15-281","article-title":"BESST - Efficient scaffolding of large fragmented assemblies","volume":"15","author":"Sahlin","year":"2014","journal-title":"BMC Bioinformatics"},{"key":"2023020109084240800_btac174-B23","doi-asserted-by":"crossref","first-page":"3506","DOI":"10.1093\/bioinformatics\/btu538","article-title":"LoRDEC: accurate and efficient long read error correction","volume":"30","author":"Salmela","year":"2014","journal-title":"Bioinformatics"},{"key":"2023020109084240800_btac174-B24","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1101\/gr.131383.111","article-title":"GAGE: a critical evaluation of genome assemblies and assembly algorithms","volume":"22","author":"Salzberg","year":"2012","journal-title":"Genome Res"},{"key":"2023020109084240800_btac174-B25","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1126\/science.8211116","article-title":"Ordered restriction maps of Saccharomyces cerevisiae chromosomes constructed by optical mapping","volume":"262","author":"Schwartz","year":"1993","journal-title":"Science"},{"volume-title":"Mathematical Statistics","year":"1999","author":"Shao","key":"2023020109084240800_btac174-B26"},{"key":"2023020109084240800_btac174-B27","doi-asserted-by":"crossref","first-page":"3210","DOI":"10.1093\/bioinformatics\/btv351","article-title":"BUSCO: assessing genome assembly and annotation completeness with single-copy orthologs","volume":"31","author":"Sim\u00e3o","year":"2015","journal-title":"Bioinformatics"},{"key":"2023020109084240800_btac174-B28","doi-asserted-by":"crossref","first-page":"2019","DOI":"10.1093\/bioinformatics\/bty020","article-title":"BAUM: improving genome assembly by adaptive unique mapping and local overlap-layout-consensus approach","volume":"34","author":"Wang","year":"2018","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btac174\/43328767\/btac174.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/38\/10\/2675\/49010126\/btac174.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/38\/10\/2675\/49010126\/btac174.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T21:02:49Z","timestamp":1675285369000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/38\/10\/2675\/6554191"}},"subtitle":[],"editor":[{"given":"Can","family":"Alkan","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2022,3,25]]},"references-count":28,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,5,13]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btac174","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"type":"print","value":"1367-4803"},{"type":"electronic","value":"1367-4811"}],"subject":[],"published-other":{"date-parts":[[2022,5,15]]},"published":{"date-parts":[[2022,3,25]]}}}