{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T10:37:35Z","timestamp":1769855855471,"version":"3.49.0"},"reference-count":57,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972134"],"award-info":[{"award-number":["61972134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Elite Teachers in Henan Province","award":["2020GGJS050"],"award-info":[{"award-number":["2020GGJS050"]}]},{"name":"Doctor Foundation of Henan Polytechnic University","award":["B2018-36"],"award-info":[{"award-number":["B2018-36"]}]},{"name":"Innovative and Scientific Research Team of Henan Polytechnic University","award":["T2021-3"],"award-info":[{"award-number":["T2021-3"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In genome assembly, scaffolding can obtain more complete and continuous scaffolds. Current scaffolding methods usually adopt one type of read to construct a scaffold graph and then orient and order contigs. However, scaffolding with the strengths of two or more types of reads seems to be a better solution to some tricky problems. Combining the advantages of different types of data is significant for scaffolding. Here, a hybrid scaffolding method (SLHSD) is present that simultaneously leverages the precision of short reads and the length advantage of long reads. Building an optimal scaffold graph is an important foundation for getting scaffolds. SLHSD uses a new algorithm that combines long and short read alignment information to determine whether to add an edge and how to calculate the edge weight in a scaffold graph. In addition, SLHSD develops a strategy to ensure that edges with high confidence can be added to the graph with priority. Then, a linear programming model is used to detect and remove remaining false edges in the graph. We compared SLHSD with other scaffolding methods on five datasets. Experimental results show that SLHSD outperforms other methods. The open-source code of SLHSD is available at https:\/\/github.com\/luojunwei\/SLHSD.<\/jats:p>","DOI":"10.1093\/bib\/bbad169","type":"journal-article","created":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T16:56:16Z","timestamp":1683219376000},"source":"Crossref","is-referenced-by-count":1,"title":["SLHSD: hybrid scaffolding method based on short and long reads"],"prefix":"10.1093","volume":"24","author":[{"given":"Junwei","family":"Luo","sequence":"first","affiliation":[{"name":"School of Software, Henan Polytechnic University , Jiaozuo 454003, China"}]},{"given":"Ting","family":"Guan","sequence":"additional","affiliation":[{"name":"School of Software, Henan Polytechnic University , Jiaozuo 454003, China"}]},{"given":"Guolin","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Software, Henan Polytechnic University , Jiaozuo 454003, China"}]},{"given":"Zhonghua","family":"Yu","sequence":"additional","affiliation":[{"name":"School of Software, Henan Polytechnic University , Jiaozuo 454003, China"}]},{"given":"Haixia","family":"Zhai","sequence":"additional","affiliation":[{"name":"School of Software, Henan Polytechnic University , Jiaozuo 454003, China"}]},{"given":"Chaokun","family":"Yan","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan University , Kaifeng 475001, China"}]},{"given":"Huimin","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer and Information Engineering, Henan University , Kaifeng 475001, China"}]}],"member":"286","published-online":{"date-parts":[[2023,5,4]]},"reference":[{"issue":"5","key":"2023052022430226100_ref1","doi-asserted-by":"crossref","first-page":"bbab033","DOI":"10.1093\/bib\/bbab033","article-title":"A comprehensive review of scaffolding methods in genome assembly","volume":"22","author":"Luo","year":"2021","journal-title":"Brief Bioinform"},{"issue":"4","key":"2023052022430226100_ref2","doi-asserted-by":"crossref","first-page":"lqac092","DOI":"10.1093\/nargab\/lqac092","article-title":"PBSIM3: a simulator for all types of PacBio and ONT long reads","volume":"4","author":"Ono","year":"2022","journal-title":"NAR Genom Bioinform"},{"issue":"11","key":"2023052022430226100_ref3","doi-asserted-by":"crossref","first-page":"jkac192","DOI":"10.1093\/g3journal\/jkac192","article-title":"Evaluating Illumina-, Nanopore-, and PacBio-based genome assembly strategies with the bald notothen, Trematomus borchgrevinki","volume":"12","author":"Rayamajhi","year":"2022","journal-title":"G3 (Bathesda)"},{"issue":"1","key":"2023052022430226100_ref4","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1038\/s41597-020-00743-4","article-title":"Highly accurate long-read HiFi sequencing data for five complex genomes","volume":"7","author":"Hon","year":"2020","journal-title":"Sci Data"},{"key":"2023052022430226100_ref5","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1126\/science.aat3872","article-title":"Directional control of a processive molecular hopper","volume":"361","author":"Qing","year":"2018","journal-title":"Science"},{"key":"2023052022430226100_ref6","doi-asserted-by":"crossref","first-page":"4025","DOI":"10.1038\/s41467-020-17800-6","article-title":"High throughput error corrected Nanopore single cell transcriptome sequencing","volume":"11","author":"Lebrigand","year":"2020","journal-title":"Nat Commun"},{"key":"2023052022430226100_ref7","doi-asserted-by":"crossref","DOI":"10.1038\/s41565-022-01193-2","article-title":"Nanopore-based technologies beyond DNA sequencing","volume":"17","author":"Ying","year":"2022","journal-title":"Nat Nanotechnol"},{"key":"2023052022430226100_ref8","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1038\/s41592-020-01056-5","article-title":"Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm","volume":"18","author":"Cheng","year":"2021","journal-title":"Nat Methods"},{"key":"2023052022430226100_ref9","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1038\/s41467-020-20236-7","article-title":"Efficient assembly of nanopore reads via highly accurate and intact error correction","volume":"12","author":"Chen","year":"2021","journal-title":"Nat Commun"},{"key":"2023052022430226100_ref10","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1101\/gr.263566.120","article-title":"HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads","volume":"30","author":"Nurk","year":"2020","journal-title":"Genome Res"},{"key":"2023052022430226100_ref11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1111\/ahg.12364","article-title":"Improved assembly and variant detection of a haploid human genome using single-molecule, high-fidelity long reads","volume":"84","author":"Vollger Mitchell","year":"2020","journal-title":"Ann Hum Genet"},{"key":"2023052022430226100_ref12","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1186\/s13059-020-1935-5","article-title":"Opportunities and challenges in long-read sequencing data analysis","volume":"21","author":"Amarasinghe","year":"2020","journal-title":"Genome Biol"},{"issue":"D1","key":"2023052022430226100_ref13","doi-asserted-by":"crossref","first-page":"D20","DOI":"10.1093\/nar\/gkab1112","article-title":"Database resources of the national center for biotechnology information","volume":"50","author":"Sayers","year":"2022","journal-title":"Nucleic Acids Res"},{"issue":"4","key":"2023052022430226100_ref14","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.gpb.2021.08.001","article-title":"The genome sequence archive family: toward explosive data growth and diverse data types","volume":"19","author":"Tingting Chen","year":"2021","journal-title":"Genom Proteom Bioinform"},{"issue":"8","key":"2023052022430226100_ref15","doi-asserted-by":"crossref","first-page":"101389","DOI":"10.1016\/j.isci.2020.101389","article-title":"HASLR: fast hybrid assembly of long reads","volume":"23","author":"Haghshenas","year":"2020","journal-title":"iScience"},{"key":"2023052022430226100_ref16","article-title":"Efficient hybrid de novo assembly of human genomes with WENGAN","volume":"39","author":"Di Genova","year":"2020","journal-title":"Nat Biotechnol"},{"key":"2023052022430226100_ref17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-40453-5_27","article-title":"Cerulean: a hybrid assembly using high throughput short and long reads[C]","volume-title":"International Workshop on Algorithms in Bioinformatics","author":"Deshpande","year":"2013"},{"issue":"21","key":"2023052022430226100_ref18","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1093\/bioinformatics\/btt476","article-title":"The MaSuRCA genome assembler","volume":"29","author":"Zimin","year":"2013","journal-title":"Bioinformatics"},{"key":"2023052022430226100_ref19","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1093\/bioinformatics\/btv688","article-title":"An algorithm for hybrid assembly of short and long reads","volume":"32","author":"Antipov","year":"2015","journal-title":"Bioinformatics"},{"key":"2023052022430226100_ref20","doi-asserted-by":"crossref","first-page":"e1005595","DOI":"10.1371\/journal.pcbi.1005595","article-title":"Unicycler: resolving bacterial genome assemblies from short and long sequencing reads","volume":"13","author":"Wick","year":"2017","journal-title":"PLoS Comput Biol"},{"key":"2023052022430226100_ref21","doi-asserted-by":"crossref","first-page":"1176934320913859","DOI":"10.1177\/1176934320913859","article-title":"PGcloser: fast parallel gap-closing tool using long-reads or Contigs to fill gaps in genomes","volume":"16","author":"Lu","year":"2020","journal-title":"Evol Bioinform"},{"issue":"11","key":"2023052022430226100_ref22","doi-asserted-by":"crossref","first-page":"e47768","DOI":"10.1371\/journal.pone.0047768","article-title":"Mind the gap: upgrading genomes with Pacific biosciences RS long-read sequencing technology","volume":"7","author":"English","year":"2012","journal-title":"PLoS One"},{"issue":"9","key":"2023052022430226100_ref23","doi-asserted-by":"crossref","first-page":"e0216885","DOI":"10.1371\/journal.pone.0216885","article-title":"gapFinisher: a reliable gap filling pipeline for SSPACE-LongRead scaffolder output","volume":"14","author":"Kammonen","year":"2019","journal-title":"PloS One"},{"issue":"1","key":"2023052022430226100_ref24","doi-asserted-by":"crossref","DOI":"10.1093\/gigascience\/giy157","article-title":"LR Gapcloser: a tiling path-based gap closer that uses long reads to complete genome assembly","volume":"8","author":"Xu","year":"2019","journal-title":"Gigascience"},{"key":"2023052022430226100_ref25","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1186\/1756-0500-7-371","article-title":"FGAP: an automated gap closing tool","volume":"7","author":"Piro","year":"2014","journal-title":"BMC Res Notes"},{"issue":"4","key":"2023052022430226100_ref26","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1093\/bioinformatics\/btq683","article-title":"Scaffolding pre-assembled contigs using sspace","volume":"27","author":"Marten","year":"2011","journal-title":"Bioinformatics"},{"issue":"1","key":"2023052022430226100_ref27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1186\/1471-2105-15-281","article-title":"Besst \u2013 efficient scaffolding of large fragmented assemblies","volume":"15","author":"Sahlin","year":"2014","journal-title":"BMC Bioinform"},{"issue":"16","key":"2023052022430226100_ref28","doi-asserted-by":"crossref","first-page":"2632","DOI":"10.1093\/bioinformatics\/btv211","article-title":"Scaffmatch: scaffolding algorithm based on maximum weight matching","volume":"31","author":"Mandric","year":"2015","journal-title":"Bioinformatics"},{"issue":"1","key":"2023052022430226100_ref29","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 Bioinform"},{"issue":"2","key":"2023052022430226100_ref30","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1093\/bioinformatics\/btw597","article-title":"Boss: a novel scaffolding algorithm based on an optimized scaffold graph","volume":"33","author":"Luo","year":"2016","journal-title":"Bioinformatics"},{"key":"2023052022430226100_ref31","doi-asserted-by":"crossref","DOI":"10.1093\/nar\/gkab717","article-title":"SWALO: scaffolding with assembly likelihood optimization","volume-title":"Nucleic Acids Res","author":"Rahman","year":"2021"},{"issue":"7","key":"2023052022430226100_ref32","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1093\/bioinformatics\/bty773","article-title":"SCOP: a novel scaffolding algorithm based on contig classification and optimization","volume":"35","author":"Li","year":"2019","journal-title":"Bioinformatics"},{"issue":"3","key":"2023052022430226100_ref33","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1109\/TCBB.2018.2858267","article-title":"A novel scaffolding algorithm based on contig error correction and path extension","volume":"16","author":"Li","year":"2018","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2023052022430226100_ref34","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1186\/s12864-020-07041-8","article-title":"Benchmarking hybrid assembly approaches for genomic analyses of bacterial pathogens using Illumina and Oxford Nanopore sequencing","volume":"21","author":"Chen","year":"2020","journal-title":"BMC Genomics"},{"issue":"5","key":"2023052022430226100_ref35","doi-asserted-by":"crossref","first-page":"bbaa399","DOI":"10.1093\/bib\/bbaa399","article-title":"Integrated hybrid de novo assembly technologies to obtain high-quality pig genome using short and long reads","volume":"22","author":"Heng","year":"2021","journal-title":"Brief Bioinform"},{"issue":"1","key":"2023052022430226100_ref36","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 Bioinform"},{"issue":"1","key":"2023052022430226100_ref37","doi-asserted-by":"crossref","DOI":"10.1186\/s13742-015-0076-3","article-title":"LINKS: scalable, alignment-free scaffolding of draft genomes with long reads","volume":"4","author":"Warren","year":"2015","journal-title":"GigaScience"},{"issue":"10","key":"2023052022430226100_ref38","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1186\/s12864-017-4271-8","article-title":"Single molecule sequencingguided scaffolding and correction of draft assemblies","volume":"18","author":"Zhu","year":"2017","journal-title":"BMC Genomics"},{"issue":"2","key":"2023052022430226100_ref39","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1186\/gb-2004-5-2-r12","article-title":"Versatile and open software for comparing large genomes","volume":"5","author":"Kurtz","year":"2004","journal-title":"Genome Biol"},{"issue":"1","key":"2023052022430226100_ref40","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 Bioinform"},{"issue":"5","key":"2023052022430226100_ref41","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1093\/bioinformatics\/btx675","article-title":"ARCS: scaffolding genome drafts with linked reads","volume":"34","author":"Yeo","year":"2018","journal-title":"Bioinformatics"},{"issue":"1","key":"2023052022430226100_ref42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/ncomms14515","article-title":"Scaffolding and completing genome assemblies in real-time with nanopore sequencing","volume":"8","author":"Cao","year":"2017","journal-title":"Nat Commun"},{"issue":"1","key":"2023052022430226100_ref43","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1186\/s12859-019-3114-9","article-title":"SLR: a scaffolding algorithm based on long reads and contig classification","volume":"20","author":"Luo","year":"2019","journal-title":"BMC Bioinform"},{"issue":"1","key":"2023052022430226100_ref44","doi-asserted-by":"crossref","first-page":"955","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":"2023052022430226100_ref45","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1186\/s12859-021-04451-7","article-title":"LongStitch: high-quality genome assembly correction and scaffolding using long reads","volume":"22","author":"Coombe","year":"2021","journal-title":"BMC Bioinform"},{"issue":"1","key":"2023052022430226100_ref46","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1186\/s12859-018-2425-6","article-title":"Tigmint: correcting assembly errors using linked reads from large molecules","volume":"19","author":"Jackman","year":"2018","journal-title":"BMC Bioinform"},{"issue":"21\u201322","key":"2023052022430226100_ref47","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1101\/gad.328971.119","article-title":"Hi-C guided assemblies reveal conserved regulatory topologies on X and autosomes despite extensive genome shuffling","volume":"33","author":"Renschler","year":"2019","journal-title":"Genes Dev"},{"issue":"1","key":"2023052022430226100_ref48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12859-018-2243-x","article-title":"ARKS: chromosome-scale scaffolding of human genome drafts with linked read kmers","volume":"19","author":"Coombe","year":"2018","journal-title":"BMC Bioinform"},{"key":"2023052022430226100_ref49","doi-asserted-by":"crossref","DOI":"10.1093\/bioinformatics\/btaa975","article-title":"ARBitR: an overlap-aware genome assembly scaffolder for linked reads","volume":"37","author":"Hiltunen","year":"2021","journal-title":"Bioinformatics"},{"issue":"1","key":"2023052022430226100_ref50","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1186\/1471-2105-13-189","article-title":"AGORA: assembly guided by optical restriction alignment","volume":"13","author":"Lin","year":"2012","journal-title":"BMC Bioinform"},{"issue":"11","key":"2023052022430226100_ref51","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1101\/gr.236273.118","article-title":"Chromosome assembly of large and complex genomes using multiple references","volume":"28","author":"Kolmogorov","year":"2018","journal-title":"Genome Res"},{"key":"2023052022430226100_ref52","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1126\/sciadv.aaz4642","article-title":"Direct detection of molecular intermediates from first-passage times","volume":"6","author":"Thorneywork","year":"2020","journal-title":"Sci Adv"},{"issue":"2","key":"2023052022430226100_ref53","doi-asserted-by":"crossref","first-page":"giab008","DOI":"10.1093\/gigascience\/giab008","article-title":"Twelve years of SAMtools and BCFtools","volume":"10","author":"Danecek","year":"2021","journal-title":"GigaScience"},{"key":"2023052022430226100_ref54","doi-asserted-by":"crossref","first-page":"1429","DOI":"10.1093\/bioinformatics\/bts175","article-title":"Grass: a generic algorithm for scaffolding next-generation sequencing assemblies","volume":"28","author":"Gritsenko","year":"2012","journal-title":"Bioinformatics"},{"key":"2023052022430226100_ref55","doi-asserted-by":"crossref","first-page":"S9","DOI":"10.1186\/1471-2105-15-S9-S9","article-title":"Ilp-based maximum likelihood genome scaffolding","volume":"15","author":"Lindsay","year":"2014","journal-title":"BMC Bioinform"},{"key":"2023052022430226100_ref56","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1089\/cmb.2011.0263","article-title":"Sliq: simple linear inequalities for efficient contig scaffolding","volume":"19","author":"Roy","year":"2012","journal-title":"J Comput Biol"},{"issue":"15","key":"2023052022430226100_ref57","doi-asserted-by":"crossref","first-page":"2530","DOI":"10.1093\/bioinformatics\/bty131","article-title":"Repeat aware evaluation of scaffolding tools","volume":"34","author":"Mandric","year":"2018","journal-title":"Bioinformatics"}],"container-title":["Briefings in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bib\/article-pdf\/24\/3\/bbad169\/50410992\/bbad169.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bib\/article-pdf\/24\/3\/bbad169\/50410992\/bbad169.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T22:43:49Z","timestamp":1684622629000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bib\/article\/doi\/10.1093\/bib\/bbad169\/7152317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,5,19]]}},"URL":"https:\/\/doi.org\/10.1093\/bib\/bbad169","relation":{},"ISSN":["1467-5463","1477-4054"],"issn-type":[{"value":"1467-5463","type":"print"},{"value":"1477-4054","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,5]]},"published":{"date-parts":[[2023,5]]},"article-number":"bbad169"}}