{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T08:20:19Z","timestamp":1772180419717,"version":"3.50.1"},"reference-count":18,"publisher":"Oxford University Press (OUP)","issue":"12","license":[{"start":{"date-parts":[[2016,10,3]],"date-time":"2016-10-03T00:00:00Z","timestamp":1475452800000},"content-version":"vor","delay-in-days":845,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,6,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: Bacterial genomes are simpler than mammalian ones, and yet assembling the former from the data currently generated by high-throughput short-read sequencing machines still results in hundreds of contigs. To improve assembly quality, recent studies have utilized longer Pacific Biosciences (PacBio) reads or jumping libraries to connect contigs into larger scaffolds or help assemblers resolve ambiguities in repetitive regions of the genome. However, their popularity in contemporary genomic research is still limited by high cost and error rates. In this work, we explore the possibility of improving assemblies by using complete genomes from closely related species\/strains. We present Ragout, a genome rearrangement approach, to address this problem. In contrast with most reference-guided algorithms, where only one reference genome is used, Ragout uses multiple references along with the evolutionary relationship among these references in order to determine the correct order of the contigs. Additionally, Ragout uses the assembly graph and multi-scale synteny blocks to reduce assembly gaps caused by small contigs from the input assembly. In simulations as well as real datasets, we believe that for common bacterial species, where many complete genome sequences from related strains have been available, the current high-throughput short-read sequencing paradigm is sufficient to obtain a single high-quality scaffold for each chromosome.<\/jats:p>\n               <jats:p>Availability: The Ragout software is freely available at: https:\/\/github.com\/fenderglass\/Ragout.<\/jats:p>\n               <jats:p>Contact: \u00a0spham@salk.edu<\/jats:p>","DOI":"10.1093\/bioinformatics\/btu280","type":"journal-article","created":{"date-parts":[[2014,6,16]],"date-time":"2014-06-16T21:55:09Z","timestamp":1402955709000},"page":"i302-i309","source":"Crossref","is-referenced-by-count":188,"title":["Ragout\u2014a reference-assisted assembly tool for bacterial genomes"],"prefix":"10.1093","volume":"30","author":[{"given":"Mikhail","family":"Kolmogorov","sequence":"first","affiliation":[{"name":"1 St. Petersburg University of the Russian Academy of Sciences, 2Bioinformatics Institute, St. Petersburg, Russia, 3UCSC, 1156 High Street, Santa Cruz, CA and 4Department of Computer Science and Engineering, UCSD, 9500 Gilman Drive, La Jolla, CA, USA"},{"name":"1 St. Petersburg University of the Russian Academy of Sciences, 2Bioinformatics Institute, St. Petersburg, Russia, 3UCSC, 1156 High Street, Santa Cruz, CA and 4Department of Computer Science and Engineering, UCSD, 9500 Gilman Drive, La Jolla, CA, USA"}]},{"given":"Brian","family":"Raney","sequence":"additional","affiliation":[{"name":"1 St. Petersburg University of the Russian Academy of Sciences, 2Bioinformatics Institute, St. Petersburg, Russia, 3UCSC, 1156 High Street, Santa Cruz, CA and 4Department of Computer Science and Engineering, UCSD, 9500 Gilman Drive, La Jolla, CA, USA"}]},{"given":"Benedict","family":"Paten","sequence":"additional","affiliation":[{"name":"1 St. Petersburg University of the Russian Academy of Sciences, 2Bioinformatics Institute, St. Petersburg, Russia, 3UCSC, 1156 High Street, Santa Cruz, CA and 4Department of Computer Science and Engineering, UCSD, 9500 Gilman Drive, La Jolla, CA, USA"}]},{"given":"Son","family":"Pham","sequence":"additional","affiliation":[{"name":"1 St. Petersburg University of the Russian Academy of Sciences, 2Bioinformatics Institute, St. Petersburg, Russia, 3UCSC, 1156 High Street, Santa Cruz, CA and 4Department of Computer Science and Engineering, UCSD, 9500 Gilman Drive, La Jolla, CA, USA"}]}],"member":"286","published-online":{"date-parts":[[2014,6,11]]},"reference":[{"key":"2023012711101387000_btu280-B1","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1101\/gr.082784.108","article-title":"Breakpoint graphs and ancestral genome reconstructions","volume":"19","author":"Alekseyev","year":"2009","journal-title":"Genome Res."},{"key":"2023012711101387000_btu280-B2","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":"2023012711101387000_btu280-B3","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1038\/nbt.2288","article-title":"A hybrid approach for the automated finishing of bacterial genomes","volume":"30","author":"Bashir","year":"2012","journal-title":"Nat. Biotechnol."},{"key":"2023012711101387000_btu280-B4","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1038\/nbt.2288","article-title":"A hybrid approach for the automated finishing of bacterial genomes","volume":"30","author":"Bashir","year":"2012","journal-title":"Nat. Biotechnol."},{"key":"2023012711101387000_btu280-B5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/11851561_16","article-title":"A unifying view of genome rearrangements","volume-title":"Proceedings of Algorithms in Bioinformatics","author":"Bergeron","year":"2006"},{"key":"2023012711101387000_btu280-B6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/978-3-642-40453-5_27","article-title":"Cerulean: A hybrid assembly using high throughput short and long reads","volume-title":"Proceedings of Algorithms in Bioinformatics","author":"Deshpande","year":"2013"},{"key":"2023012711101387000_btu280-B7","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1093\/sysbio\/20.4.406","article-title":"Toward defining the course of evolution: minimum change for a specific tree topology","volume":"20","author":"Fitch","year":"1971","journal-title":"Syst. Biol."},{"key":"2023012711101387000_btu280-B8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/11864127_10","article-title":"Ordering partially assembled genomes using gene arrangements","volume-title":"Proceedings of the Comparative Genomics","author":"Gaul","year":"2006"},{"key":"2023012711101387000_btu280-B9","doi-asserted-by":"crossref","first-page":"1785","DOI":"10.1073\/pnas.1220349110","article-title":"Reference-assisted chromosome assembly","volume":"110","author":"Kim","year":"2013","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012711101387000_btu280-B10","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1038\/nbt.2280","article-title":"Hybrid error correction and de novo assembly of single-molecule sequencing reads","volume":"30","author":"Koren","year":"2012","journal-title":"Nat. Biotechnol."},{"key":"2023012711101387000_btu280-B11","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1101\/gr.5383506","article-title":"Reconstructing contiguous regions of an ancestral genome","volume":"16","author":"Ma","year":"2006","journal-title":"Genome Res."},{"key":"2023012711101387000_btu280-B12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-642-40453-5_17","article-title":"Sibelia: A scalable and comprehensive synteny block generation tool for closely related microbial genomes","volume-title":"Proceedings of Algorithms in Bioinformatics","author":"Minkin","year":"2013"},{"key":"2023012711101387000_btu280-B13","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1101\/gr.123356.111","article-title":"Cactus: Algorithms for genome multiple sequence alignment","volume":"21","author":"Paten","year":"2011","journal-title":"Genome Res."},{"key":"2023012711101387000_btu280-B14","doi-asserted-by":"crossref","first-page":"2509","DOI":"10.1093\/bioinformatics\/btq465","article-title":"Drimm-synteny: decomposing genomes into evolutionary conserved segments","volume":"26","author":"Pham","year":"2010","journal-title":"Bioinformatics"},{"key":"2023012711101387000_btu280-B15","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":"2023012711101387000_btu280-B16","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":"2023012711101387000_btu280-B17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0128004","article-title":"Minimal mutation trees of sequences","volume":"28","author":"Sankoff","year":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"2023012711101387000_btu280-B18","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."}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/12\/i302\/48924772\/bioinformatics_30_12_i302.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/12\/i302\/48924772\/bioinformatics_30_12_i302.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T11:49:39Z","timestamp":1674820179000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/30\/12\/i302\/388572"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,11]]},"references-count":18,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2014,6,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btu280","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2014,6,15]]},"published":{"date-parts":[[2014,6,11]]}}}