{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T21:04:53Z","timestamp":1782421493206,"version":"3.54.5"},"reference-count":19,"publisher":"Cold Spring Harbor Laboratory","issue":"5","funder":[{"DOI":"10.13039\/501100004488","name":"Croatian Science Foundation","doi-asserted-by":"crossref","award":["UIP-11-2013-7353"],"award-info":[{"award-number":["UIP-11-2013-7353"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Croatian Academy of Sciences and Arts"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genome Res."],"published-print":{"date-parts":[[2017,5]]},"abstract":"<jats:p>The assembly of long reads from Pacific Biosciences and Oxford Nanopore Technologies typically requires resource-intensive error-correction and consensus-generation steps to obtain high-quality assemblies. We show that the error-correction step can be omitted and that high-quality consensus sequences can be generated efficiently with a SIMD-accelerated, partial-order alignment\u2013based, stand-alone consensus module called Racon. Based on tests with PacBio and Oxford Nanopore data sets, we show that Racon coupled with miniasm enables consensus genomes with similar or better quality than state-of-the-art methods while being an order of magnitude faster.<\/jats:p>","DOI":"10.1101\/gr.214270.116","type":"journal-article","created":{"date-parts":[[2017,1,18]],"date-time":"2017-01-18T21:10:23Z","timestamp":1484773823000},"page":"737-746","source":"Crossref","is-referenced-by-count":3022,"title":["Fast and accurate de novo genome assembly from long uncorrected reads"],"prefix":"10.1101","volume":"27","author":[{"given":"Robert","family":"Vaser","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ivan","family":"Sovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niranjan","family":"Nagarajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8370-0891","authenticated-orcid":false,"given":"Mile","family":"\u0160iki\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"246","published-online":{"date-parts":[[2017,1,18]]},"reference":[{"key":"2021111811155719000_27.5.737.1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3238"},{"key":"2021111811155719000_27.5.737.2","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-238"},{"key":"2021111811155719000_27.5.737.3","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2474"},{"key":"2021111811155719000_27.5.737.4","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.4035"},{"key":"2021111811155719000_27.5.737.5","doi-asserted-by":"crossref","unstructured":"Delcher AL , Salzberg SL , Phillippy AM . 2003. Using MUMmer to identify similar regions in large sequence sets. Curr Protoc Bioinformatics Chapter 10: Unit 10.3.","DOI":"10.1002\/0471250953.bi1003s00"},{"key":"2021111811155719000_27.5.737.6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(82)90398-9"},{"key":"2021111811155719000_27.5.737.7","doi-asserted-by":"publisher","DOI":"10.1101\/066613"},{"key":"2021111811155719000_27.5.737.8","doi-asserted-by":"publisher","DOI":"10.1101\/gr.215087.116"},{"key":"2021111811155719000_27.5.737.9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btg109"},{"key":"2021111811155719000_27.5.737.10","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.3.452"},{"key":"2021111811155719000_27.5.737.11","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw152"},{"key":"2021111811155719000_27.5.737.12","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.3444"},{"key":"2021111811155719000_27.5.737.13","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.3930"},{"key":"2021111811155719000_27.5.737.14","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316550"},{"key":"2021111811155719000_27.5.737.15","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.8.699"},{"key":"2021111811155719000_27.5.737.16","doi-asserted-by":"publisher","DOI":"10.1101\/070649"},{"key":"2021111811155719000_27.5.737.17","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw237"},{"key":"2021111811155719000_27.5.737.18","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms11307"},{"key":"2021111811155719000_27.5.737.19","doi-asserted-by":"publisher","DOI":"10.7717\/peerj.2016"}],"container-title":["Genome Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/syndication.highwire.org\/content\/doi\/10.1101\/gr.214270.116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T15:32:07Z","timestamp":1637249527000},"score":1,"resource":{"primary":{"URL":"http:\/\/genome.cshlp.org\/lookup\/doi\/10.1101\/gr.214270.116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,18]]},"references-count":19,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2017,5,1]]},"published-print":{"date-parts":[[2017,5]]}},"alternative-id":["10.1101\/gr.214270.116"],"URL":"https:\/\/doi.org\/10.1101\/gr.214270.116","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/068122","asserted-by":"object"}]},"ISSN":["1088-9051","1549-5469"],"issn-type":[{"value":"1088-9051","type":"print"},{"value":"1549-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,18]]}}}