{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:34:25Z","timestamp":1770284065037,"version":"3.49.0"},"reference-count":8,"publisher":"Oxford University Press (OUP)","issue":"1","license":[{"start":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T00:00:00Z","timestamp":1504137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/about_us\/legal\/notices"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology of Taiwan","doi-asserted-by":"publisher","award":["MOST106-2221-E-007-117"],"award-info":[{"award-number":["MOST106-2221-E-007-117"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:sec>\n                  <jats:title>Summary<\/jats:title>\n                  <jats:p>Advances in next generation sequencing have generated massive amounts of short reads. However, assembling genome sequences from short reads still remains a challenging task. Due to errors in reads and large repeats in the genome, many of current assembly tools usually produce just collections of contigs whose relative positions and orientations along the genome being sequenced are still unknown. To address this issue, a scaffolding process to order and orient the contigs of a draft genome is needed for completing the genome sequence. In this work, we propose a new scaffolding tool called CSAR that can efficiently and more accurately order and orient the contigs of a given draft genome based on a reference genome of a related organism. In particular, the reference genome required by CSAR is not necessary to be complete in sequence. Our experimental results on real datasets have shown that CSAR outperforms other similar tools such as Projector2, OSLay and Mauve Aligner in terms of average sensitivity, precision, F-score, genome coverage, NGA50 and running time.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Availability and implementation<\/jats:title>\n                  <jats:p>The program of CSAR can be downloaded from https:\/\/github.com\/ablab-nthu\/CSAR.<\/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\/btx543","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T11:09:29Z","timestamp":1504091369000},"page":"109-111","source":"Crossref","is-referenced-by-count":33,"title":["CSAR: a contig scaffolding tool using algebraic rearrangements"],"prefix":"10.1093","volume":"34","author":[{"given":"Kun-Tze","family":"Chen","sequence":"first","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chia-Liang","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shang-Hao","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsin-Ting","family":"Shen","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi-Kung","family":"Shieh","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsien-Tai","family":"Chiu","sequence":"additional","affiliation":[{"name":"Department of Chemistry, National Cheng Kung University, Tainan City, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin Lung","family":"Lu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2017,8,31]]},"reference":[{"key":"2023020208303335200_btx543-B1","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":"2023020208303335200_btx543-B2","doi-asserted-by":"crossref","first-page":"R12.","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"},{"key":"2023020208303335200_btx543-B3","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1089\/cmb.2015.0073","article-title":"An efficient algorithm for the contig ordering problem under algebraic rearrangement distance","volume":"22","author":"Lu","year":"2015","journal-title":"J. Comput. Biol"},{"key":"2023020208303335200_btx543-B4","doi-asserted-by":"crossref","first-page":"381.","DOI":"10.1186\/s12859-014-0381-3","article-title":"CAR: contig assembly of prokaryotic draft genomes using rearrangements","volume":"15","author":"Lu","year":"2014","journal-title":"BMC Bioinformatics"},{"key":"2023020208303335200_btx543-B5","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1093\/bib\/bbp026","article-title":"Genome assembly reborn: recent computational challenges","volume":"10","author":"Pop","year":"2009","journal-title":"Brief. Bioinf"},{"key":"2023020208303335200_btx543-B6","doi-asserted-by":"crossref","first-page":"1573","DOI":"10.1093\/bioinformatics\/btm153","article-title":"OSLay: optimal syntenic layout of unfinished assemblies","volume":"23","author":"Richter","year":"2007","journal-title":"Bioinformatics"},{"key":"2023020208303335200_btx543-B7","doi-asserted-by":"crossref","first-page":"2071","DOI":"10.1093\/bioinformatics\/btp356","article-title":"Reordering contigs of draft genomes using the Mauve Aligner","volume":"25","author":"Rissman","year":"2009","journal-title":"Bioinformatics"},{"key":"2023020208303335200_btx543-B8","doi-asserted-by":"crossref","first-page":"W560","DOI":"10.1093\/nar\/gki356","article-title":"Projector 2: contig mapping for efficient gap-closure of prokaryotic genome sequence assemblies","volume":"33","author":"van Hijum","year":"2005","journal-title":"Nucleic Acids Res"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/1\/109\/49043488\/bioinformatics_34_1_109.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/1\/109\/49043488\/bioinformatics_34_1_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T08:41:02Z","timestamp":1675327262000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/34\/1\/109\/4100160"}},"subtitle":[],"editor":[{"given":"Bonnie","family":"Berger","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2017,8,31]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btx543","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,1,1]]},"published":{"date-parts":[[2017,8,31]]}}}