{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T21:00:58Z","timestamp":1778965258573,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004488","name":"Hrvatska Zaklada za Znanost","doi-asserted-by":"publisher","award":["IP-2018-01-5886"],"award-info":[{"award-number":["IP-2018-01-5886"]}],"id":[{"id":"10.13039\/501100004488","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"EC | European Regional Development Fund","doi-asserted-by":"publisher","award":["KK.01.1.1.01.0009"],"award-info":[{"award-number":["KK.01.1.1.01.0009"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput Sci"],"DOI":"10.1038\/s43588-021-00073-4","type":"journal-article","created":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T12:05:57Z","timestamp":1621512357000},"page":"332-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":446,"title":["Time- and memory-efficient genome assembly with Raven"],"prefix":"10.1038","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8717-5414","authenticated-orcid":false,"given":"Robert","family":"Vaser","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8370-0891","authenticated-orcid":false,"given":"Mile","family":"\u0160iki\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,20]]},"reference":[{"key":"73_CR1","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1101\/gr.215087.116","volume":"27","author":"S Koren","year":"2017","unstructured":"Koren, S. et al. Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation. Genome Res. 27, 722\u2013736 (2017).","journal-title":"Genome Res."},{"key":"73_CR2","doi-asserted-by":"publisher","first-page":"1050","DOI":"10.1038\/nmeth.4035","volume":"13","author":"C-S Chin","year":"2016","unstructured":"Chin, C.-S. et al. Phased diploid genome assembly with single-molecule real-time sequencing. Nat. Methods 13, 1050\u20131054 (2016).","journal-title":"Nat. Methods"},{"key":"73_CR3","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1038\/s41587-019-0072-8","volume":"37","author":"M Kolmogorov","year":"2019","unstructured":"Kolmogorov, M., Yuan, J., Lin, Y. & Pevzner, P. A. Assembly of long, error-prone reads using repeat graphs. Nat. Biotechnol. 37, 540\u2013546 (2019).","journal-title":"Nat. Biotechnol."},{"key":"73_CR4","doi-asserted-by":"publisher","first-page":"2103","DOI":"10.1093\/bioinformatics\/btw152","volume":"32","author":"H Li","year":"2016","unstructured":"Li, H. Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences. Bioinformatics 32, 2103\u20132110 (2016).","journal-title":"Bioinformatics"},{"key":"73_CR5","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1038\/s41587-020-0503-6","volume":"38","author":"K Shafin","year":"2020","unstructured":"Shafin, K. et al. Nanopore sequencing and the Shasta toolkit enable efficient de novo assembly of eleven human genomes. Nat. Biotechnol. 38, 1044\u20131053 (2020).","journal-title":"Nat. Biotechnol."},{"key":"73_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1038\/s41592-019-0669-3","volume":"17","author":"J Ruan","year":"2020","unstructured":"Ruan, J. & Li, H. Fast and accurate long-read assembly with wtdbg2. Nat. Methods 17, 155\u2013158 (2020).","journal-title":"Nat. Methods"},{"key":"73_CR7","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1101\/gr.216465.116","volume":"27","author":"GM Kamath","year":"2017","unstructured":"Kamath, G. M., Shomorony, I., Xia, F., Courtade, T. A. & Tse, D. N. HINGE: long-read assembly achieves optimal repeat resolution. Genome Res. 27, 747\u2013756 (2017).","journal-title":"Genome Res."},{"key":"73_CR8","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1101\/gr.214270.116","volume":"27","author":"R Vaser","year":"2017","unstructured":"Vaser, R., Sovi\u0107, I., Nagarajan, N. & \u0160iki\u0107, M. Fast and accurate de novo genome assembly from long uncorrected reads. Genome Res. 27, 737\u2013746 (2017).","journal-title":"Genome Res."},{"key":"73_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul, S. F., Gish, W., Miller, W., Myers, E. W. & Lipman, D. J. Basic local alignment search tool. J. Mol. Biol. 215, 403\u2013410 (1990).","journal-title":"J. Mol. Biol."},{"key":"73_CR10","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H Li","year":"2009","unstructured":"Li, H. & Durbin, R. Fast and accurate short read alignment with Burrows\u2013Wheeler transform. Bioinformatics 25, 1754\u20131760 (2009).","journal-title":"Bioinformatics"},{"key":"73_CR11","doi-asserted-by":"publisher","unstructured":"Broder, A. Z. On the resemblance and containment of documents. In Proc. Compression and Complexity of SEQUENCES 1997 (cat. no. 97TB100171) (eds. Carpentieri, B. et al.) 21\u201329 (IEEE, 1997); https:\/\/doi.org\/10.1109\/SEQUEN.1997.666900","DOI":"10.1109\/SEQUEN.1997.666900"},{"key":"73_CR12","doi-asserted-by":"crossref","unstructured":"Jain, C., Dilthey, A., Koren, S., Aluru, S. & Phillippy, A. M. A fast approximate algorithm for mapping long reads to large reference databases. In Research in Computational Molecular Biology (ed. Sahinalp, S. C.) 66\u201381 (Springer, 2017).","DOI":"10.1007\/978-3-319-56970-3_5"},{"key":"73_CR13","doi-asserted-by":"publisher","unstructured":"Chin, C.-S. & Khalak, A. Human genome assembly in 100 minutes. Preprint at bioRxiv https:\/\/doi.org\/10.1101\/705616 (2019).","DOI":"10.1101\/705616"},{"key":"73_CR14","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T. M. J. & Reingold, E. M. Graph drawing by force-directed placement. Softw. Pract. Exp. 21, 1129\u20131164 (1991).","journal-title":"Softw. Pract. Exp."},{"key":"73_CR15","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J Barnes","year":"1986","unstructured":"Barnes, J. & Hut, P. A hierarchical O(NlogN) force-calculation algorithm. Nature 324, 446\u2013449 (1986).","journal-title":"Nature"},{"key":"73_CR16","doi-asserted-by":"publisher","first-page":"2138","DOI":"10.12688\/f1000research.21782.3","volume":"8","author":"RR Wick","year":"2020","unstructured":"Wick, R. R. & Holt, K. E. Benchmarking of long-read assemblers for prokaryote whole genome sequencing. F1000Res. 8, 2138 (2020).","journal-title":"F1000Res."},{"key":"73_CR17","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1101\/gr.263566.120","volume":"30","author":"S Nurk","year":"2020","unstructured":"Nurk, S. et al. HiCanu: accurate assembly of segmental duplications, satellites, and allelic variants from high-fidelity long reads. Genome Res. 30, 1291\u20131305 (2020).","journal-title":"Genome Res."},{"key":"73_CR18","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1038\/s41592-020-01056-5","volume":"18","author":"H Cheng","year":"2021","unstructured":"Cheng, H., Concepcion, G. T., Feng, X., Zhang, H. & Li, H. Haplotype-resolved de novo assembly using phased assembly graphs with hifiasm. Nat. Methods 18, 170\u2013175 (2021).","journal-title":"Nat. Methods"},{"key":"73_CR19","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1038\/s41477-018-0289-4","volume":"4","author":"C Belser","year":"2018","unstructured":"Belser, C. et al. Chromosome-scale assemblies of plant genomes using nanopore long reads and optical maps. Nat. Plants 4, 879\u2013887 (2018).","journal-title":"Nat. Plants"},{"key":"73_CR20","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-020-1938-2","volume":"21","author":"JY Choi","year":"2020","unstructured":"Choi, J. Y. et al. Nanopore sequencing-based genome assembly and evolutionary genomics of circum-basmati rice. Genome Biol. 21, 21 (2020).","journal-title":"Genome Biol."},{"key":"73_CR21","doi-asserted-by":"publisher","unstructured":"Vaser, R. & \u0160iki\u0107, M. Yet another de novo genome assembler. In Proc. 2019 11th International Symposium on Image and Signal Processing and Analysis (ISPA) (eds. Lon\u010dari\u0107, S. et al.) 147\u2013151 (IEEE, 2019); https:\/\/doi.org\/10.1109\/ISPA.2019.8868909","DOI":"10.1109\/ISPA.2019.8868909"},{"key":"73_CR22","doi-asserted-by":"publisher","first-page":"3210","DOI":"10.1093\/bioinformatics\/btv351","volume":"31","author":"FA Sim\u00e3o","year":"2015","unstructured":"Sim\u00e3o, F. A., Waterhouse, R. M., Ioannidis, P., Kriventseva, E. V. & Zdobnov, E. M. BUSCO: assessing genome assembly and annotation completeness with single-copy orthologs. Bioinformatics 31, 3210\u20133212 (2015).","journal-title":"Bioinformatics"},{"key":"73_CR23","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1038\/nbt.4060","volume":"36","author":"M Jain","year":"2018","unstructured":"Jain, M. et al. Nanopore sequencing and assembly of a human genome with ultra-long reads. Nat. Biotechnol. 36, 338\u2013345 (2018).","journal-title":"Nat. Biotechnol."},{"key":"73_CR24","doi-asserted-by":"publisher","first-page":"i142","DOI":"10.1093\/bioinformatics\/bty266","volume":"34","author":"A Mikheenko","year":"2018","unstructured":"Mikheenko, A., Prjibelski, A., Saveliev, V., Antipov, D. & Gurevich, A. Versatile genome assembly evaluation with QUAST-LG. Bioinformatics 34, i142\u2013i150 (2018).","journal-title":"Bioinformatics"},{"key":"73_CR25","doi-asserted-by":"publisher","first-page":"3094","DOI":"10.1093\/bioinformatics\/bty191","volume":"34","author":"H Li","year":"2018","unstructured":"Li, H. Minimap2: pairwise alignment for nucleotide sequences. Bioinformatics 34, 3094\u20133100 (2018).","journal-title":"Bioinformatics"},{"key":"73_CR26","doi-asserted-by":"publisher","unstructured":"Vaser, R. & Sikic, M. 2021. Assemblies generated in the manuscript \u2018Time and memory efficient genome assembly with Raven\u2019. Zenodo https:\/\/doi.org\/10.5281\/zenodo.4443062","DOI":"10.5281\/zenodo.4443062"},{"key":"73_CR27","doi-asserted-by":"publisher","unstructured":"Vaser, R. & Sikic, M. 2021. Raven source code used in the manuscript \u2018Time and memory efficient genome assembly with Raven\u2019. Zenodo https:\/\/doi.org\/10.5281\/zenodo.4672196","DOI":"10.5281\/zenodo.4672196"}],"container-title":["Nature Computational Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s43588-021-00073-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-021-00073-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s43588-021-00073-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T16:26:17Z","timestamp":1670084777000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s43588-021-00073-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,20]]},"references-count":27,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,5]]}},"alternative-id":["73"],"URL":"https:\/\/doi.org\/10.1038\/s43588-021-00073-4","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2020.08.07.242461","asserted-by":"object"}]},"ISSN":["2662-8457"],"issn-type":[{"value":"2662-8457","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,20]]},"assertion":[{"value":"23 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}