{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T16:15:56Z","timestamp":1773677756241,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T00:00:00Z","timestamp":1770422400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T00:00:00Z","timestamp":1773619200000},"content-version":"vor","delay-in-days":37,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"MEXT | Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["26650146"],"award-info":[{"award-number":["26650146"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Data"],"DOI":"10.1038\/s41597-026-06779-2","type":"journal-article","created":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T08:35:44Z","timestamp":1770453344000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum virtual dataset for reproducible triploid de novo genome assembly"],"prefix":"10.1038","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2186-568X","authenticated-orcid":false,"given":"Ryo","family":"Ootsuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,7]]},"reference":[{"key":"6779_CR1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.7683334","author":"R Ootsuki","year":"2023","unstructured":"Ootsuki, R. Virtual NGS data used in the paper \u201cOptimal k-mer values for good-quality triploid genome assemblies\u201d and its assembly results. Zenodo https:\/\/doi.org\/10.5281\/zenodo.7683334 (2023)."},{"key":"6779_CR2","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/S0168-9525(00)02024-2","volume":"16","author":"P Rice","year":"2000","unstructured":"Rice, P., Longden, I. & Bleasby, A. EMBOSS: the European molecular biology open software suite. Trends Genet. 16, 276\u2013277, https:\/\/doi.org\/10.1016\/S0168-9525(00)02024-2 (2000).","journal-title":"Trends Genet."},{"key":"6779_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1093\/bioinformatics\/btr708","volume":"28","author":"W Huang","year":"2012","unstructured":"Huang, W., Li, L., Myers, J. R. & Marth, G. T. ART: a next-generation sequencing read simulator. Bioinformatics 28, 593\u2013594, https:\/\/doi.org\/10.1093\/bioinformatics\/btr708 (2012).","journal-title":"Bioinformatics"},{"key":"6779_CR4","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/bioinformatics\/bts690","volume":"29","author":"Y Liu","year":"2013","unstructured":"Liu, Y., Schr\u00f6der, J. & Schmidt, B. Musket: a multistage k-mer spectrum-based error corrector for Illumina sequence data. Bioinformatics 29, 308\u2013315, https:\/\/doi.org\/10.1093\/bioinformatics\/bts690 (2013).","journal-title":"Bioinformatics"},{"key":"6779_CR5","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1186\/1748-7188-8-22","volume":"8","author":"R Chikhi","year":"2013","unstructured":"Chikhi, R. & Rizk, G. Space-efficient and exact de Bruijn graph representation based on a Bloom filter. Algorithms Mol. Biol. 8, 22, https:\/\/doi.org\/10.1186\/1748-7188-8-22 (2013).","journal-title":"Algorithms Mol. Biol."},{"key":"6779_CR6","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, https:\/\/doi.org\/10.1093\/bioinformatics\/bty266 (2018).","journal-title":"Bioinformatics"},{"key":"6779_CR7","doi-asserted-by":"publisher","DOI":"10.1038\/s41597-020-0428-4","volume":"7","author":"M Kyriakidou","year":"2020","unstructured":"Kyriakidou, M. et al. Genome assembly of six polyploid potato genomes. Sci. Data 7, 88, https:\/\/doi.org\/10.1038\/s41597-020-0428-4 (2020).","journal-title":"Sci. Data"},{"key":"6779_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/10618600.1996.10474713","volume":"5","author":"R Ihaka","year":"1996","unstructured":"Ihaka, R. & Gentleman, R. R: a language for data analysis and graphics. J. Comput. Graph. Stat. 5, 299\u2013314, https:\/\/doi.org\/10.1080\/10618600.1996.10474713 (1996).","journal-title":"J. Comput. Graph. Stat."}],"container-title":["Scientific Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41597-026-06779-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41597-026-06779-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41597-026-06779-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:50:02Z","timestamp":1773672602000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41597-026-06779-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,7]]},"references-count":8,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["6779"],"URL":"https:\/\/doi.org\/10.1038\/s41597-026-06779-2","relation":{"references":[{"id-type":"doi","id":"10.5281\/zenodo.7683334","asserted-by":"subject"}]},"ISSN":["2052-4463"],"issn-type":[{"value":"2052-4463","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,7]]},"assertion":[{"value":"1 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author declares no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"382"}}