{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:14:01Z","timestamp":1743135241063,"version":"3.40.3"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["408314\/2023-0","408314\/2023-0"],"award-info":[{"award-number":["408314\/2023-0","408314\/2023-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004901","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Minas Gerais","doi-asserted-by":"publisher","award":["APQ-01217-22"],"award-info":[{"award-number":["APQ-01217-22"]}],"id":[{"id":"10.13039\/501100004901","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00236-024-00467-7","type":"journal-article","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T20:59:25Z","timestamp":1732222765000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Comparative genomics with succinct colored de\u00a0Bruijn graphs"],"prefix":"10.1007","volume":"62","author":[{"given":"Lucas P.","family":"Ramos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felipe A.","family":"Louza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guilherme P.","family":"Telles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,21]]},"reference":[{"key":"467_CR1","volume-title":"Modern Information Retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B., et al.: Modern Information Retrieval, vol. 463. ACM Press, New York (1999)"},{"issue":"9","key":"467_CR2","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1089\/cmb.2018.0230","volume":"26","author":"P Bonizzoni","year":"2019","unstructured":"Bonizzoni, P., Vedova, G.D., Pirola, Y., Previtali, M., Rizzi, R.: Multithread multistring Burrows\u2013Wheeler transform and longest common prefix array. J. Comput. Biol. 26(9), 948\u2013961 (2019)","journal-title":"J. Comput. Biol."},{"key":"467_CR3","doi-asserted-by":"crossref","unstructured":"Bowe, A., Onodera, T., Sadakane, K., Shibuya, T.: Succinct de Bruijn graphs. In: Proc. WABI 2017, volume 7534, pp. 225\u2013235. Springer (2012)","DOI":"10.1007\/978-3-642-33122-0_18"},{"key":"467_CR4","unstructured":"Burrows, M., Wheeler, D.J.: A block-sorting lossless data compression algorithm. Technical Report 124, Systems Research Center (1994)"},{"key":"467_CR5","unstructured":"Cenzato, D., Lipt\u00e1k, Z.: A theoretical and experimental analysis of BWT variants for string collections. In: 33rd Annual Symposium on Combinatorial Pattern Matching, volume 223, pp. 25:1\u201325:18"},{"issue":"4","key":"467_CR6","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vitanyi, P.M.B.: Clustering by compression. IEEE Trans. Inf. Theory 51(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7167","key":"467_CR7","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1038\/nature06341","volume":"450","author":"AG Clark","year":"2007","unstructured":"Clark, A.G., Pachter, L.: Evolution of genes and genomes on the drosophila phylogeny. Nature 450(7167), 203\u2013218 (2007)","journal-title":"Nature"},{"key":"467_CR8","unstructured":"De\u00a0Bruijn, N.G.: A combinatorial problem. In: Proc. Koninklijke Nederlandse Academie van Wetenschappen, volume\u00a049, pp. 758\u2013764 (1946)"},{"issue":"1","key":"467_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13015-019-0140-0","volume":"14","author":"L Egidi","year":"2019","unstructured":"Egidi, L., Louza, F.A., Manzini, G., Telles, G.P.: External memory BWT and LCP computation for sequence collections with applications. Algorithms Mol. Biol. 14(1), 1\u201315 (2019)","journal-title":"Algorithms Mol. Biol."},{"key":"467_CR10","first-page":"1","volume":"13","author":"P Ferragina","year":"2009","unstructured":"Ferragina, P., Gonz\u00e1lez, R., Navarro, G., Venturini, R.: Compressed text indexes: from theory to practice. J. Exp. Algorithmics (JEA) 13, 1\u201312 (2009)","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"467_CR11","doi-asserted-by":"crossref","unstructured":"Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 390\u2013398. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892127"},{"issue":"1","key":"467_CR12","doi-asserted-by":"crossref","first-page":"2:1","DOI":"10.1145\/3375890","volume":"67","author":"T Gagie","year":"2020","unstructured":"Gagie, T., Navarro, G., Prezza, N.: Fully functional suffix trees and optimal text searching in bwt-runs bounded space. J. ACM 67(1), 2:1-2:54 (2020)","journal-title":"J. ACM"},{"issue":"11","key":"467_CR13","volume":"3","author":"MW Hahn","year":"2007","unstructured":"Hahn, M.W., Han, M.V., Han, S.-G.: Gene family evolution across 12 drosophila genomes. PLoS Genet. 3(11), e197 (2007)","journal-title":"PLoS Genet."},{"issue":"1","key":"467_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1186\/s13015-024-00260-8","volume":"19","author":"A Hong","year":"2024","unstructured":"Hong, A., Oliva, M., K\u00f6ppl, D., Bannai, H., Boucher, C., Gagie, T.: Pfp-fm: an accelerated fm-index. Algorithms Mol. Biol. 19(1), 15 (2024)","journal-title":"Algorithms Mol. Biol."},{"issue":"2","key":"467_CR15","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1038\/ng.1028","volume":"44","author":"Z Iqbal","year":"2012","unstructured":"Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de Bruijn graphs. Nat. Genet. 44(2), 226\u2013232 (2012)","journal-title":"Nat. Genet."},{"key":"467_CR16","doi-asserted-by":"crossref","first-page":"189811","DOI":"10.1109\/ACCESS.2020.3031159","volume":"8","author":"J Kim","year":"2020","unstructured":"Kim, J., Ji, M., Yi, G.: A review on sequence alignment algorithms for short reads based on next-generation sequencing. IEEE Access 8, 189811\u2013189822 (2020)","journal-title":"IEEE Access"},{"issue":"11","key":"467_CR17","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1038\/s41592-020-00971-x","volume":"17","author":"M Kolmogorov","year":"2020","unstructured":"Kolmogorov, M., Bickhart, D.M., Behsaz, B., Gurevich, A., Rayko, M., Shin, S.B., Kuhn, K., Yuan, J., Polevikov, E., Smith, T.P.L., et al.: metaFlye: scalable long-read metagenome assembly using repeat graphs. Nat. Methods 17(11), 1103\u20131110 (2020)","journal-title":"Nat. Methods"},{"issue":"4","key":"467_CR18","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1038\/nmeth.1923","volume":"9","author":"B Langmead","year":"2012","unstructured":"Langmead, B., Salzberg, S.L.: Fast gapped-read alignment with Bowtie 2. Nat. Methods 9(4), 357 (2012)","journal-title":"Nat. Methods"},{"issue":"W1","key":"467_CR19","doi-asserted-by":"crossref","first-page":"W293","DOI":"10.1093\/nar\/gkab301","volume":"49","author":"I Letunic","year":"2021","unstructured":"Letunic, I., Bork, P.: Interactive Tree Of Life (iTOL) v5: an online tool for phylogenetic tree display and annotation. Nucleic Acids Res. 49(W1), W293\u2013W296 (2021)","journal-title":"Nucleic Acids Res."},{"issue":"14","key":"467_CR20","doi-asserted-by":"crossref","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(14), 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"key":"467_CR21","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.tcs.2017.03.039","volume":"678","author":"FA Louza","year":"2017","unstructured":"Louza, F.A., Gog, S., Telles, G.P.: Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. 678, 22\u201339 (2017)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"467_CR22","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1186\/s13015-020-00177-y","volume":"15","author":"FA Louza","year":"2020","unstructured":"Louza, F.A., Telles, G.P., Gog, S., Prezza, N., Rosone, G.: gsufsort: constructing suffix arrays, LCP arrays and bwts for string collections. Algorithms Mol. Biol. 15(1), 18 (2020)","journal-title":"Algorithms Mol. Biol."},{"key":"467_CR23","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.tcs.2019.03.012","volume":"782","author":"FA Louza","year":"2019","unstructured":"Louza, F.A., Telles, G.P., Gog, S., Zhao, L.: Algorithms to compute the Burrows\u2013Wheeler similarity distribution. Theor. Comput. Sci. 782, 145\u2013156 (2019)","journal-title":"Theor. Comput. Sci."},{"key":"467_CR24","doi-asserted-by":"crossref","unstructured":"Lyman, C.A., Fujimoto, M.S., Suvorov, A., Bodily, P.M., Snell, Q., Crandall, K.A., Bybee, S.M., Clement, M.J.: Whole genome phylogenetic tree reconstruction using colored de Bruijn graphs. In: IEEE 17th International Conference on Bioinformatics and Bioengineering (BIBE), pp. 260\u2013265. IEEE (2017)","DOI":"10.1109\/BIBE.2017.00-44"},{"key":"467_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139940023","volume-title":"Genome-Scale Algorithm Design","author":"V M\u00e4kinen","year":"2015","unstructured":"M\u00e4kinen, V., Belazzougui, D., Cunial, F., Tomescu, A.I.: Genome-Scale Algorithm Design. Cambridge University Press, Cambridge (2015)"},{"issue":"5","key":"467_CR26","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"467_CR27","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows\u2013Wheeler transform. Theor. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"467_CR28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ijar.2007.03.011","volume":"47","author":"S Mantaci","year":"2008","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Distance measures for biological sequences: some recent approaches. Int. J. Approx. Reason. 47(1), 109\u2013124 (2008)","journal-title":"Int. J. Approx. Reason."},{"key":"467_CR29","doi-asserted-by":"crossref","unstructured":"Munro, J.I.: Tables. In: 16th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1180, pp. 37\u201342 (1996)","DOI":"10.1007\/3-540-62034-6_35"},{"key":"467_CR30","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316588284","volume-title":"Compact Data Structures: a Practical Approach","author":"G Navarro","year":"2016","unstructured":"Navarro, G.: Compact Data Structures: a Practical Approach. Cambridge University Press, Cambridge (2016)"},{"issue":"1","key":"467_CR31","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1216370.1216372","volume":"39","author":"G Navarro","year":"2007","unstructured":"Navarro, G., M\u00e4kinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1), 2 (2007)","journal-title":"ACM Comput. Surv."},{"key":"467_CR32","unstructured":"Ohlebusch, E.: Bioinformatics algorithms. Enno Ohlebusch (2013)"},{"key":"467_CR33","unstructured":"Polevikov, E., Kolmogorov, M.: Synteny paths for assembly graphs comparison. In: 19th International Workshop on Algorithms in Bioinformatics (WABI 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"467_CR34","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.tcs.2020.11.024","volume":"852","author":"N Prezza","year":"2021","unstructured":"Prezza, N., Rosone, G.: Space-efficient construction of compressed suffix trees. Theor. Comput. Sci. 852, 138\u2013156 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"467_CR35","doi-asserted-by":"crossref","unstructured":"Ramos, L.P., Louza, F.A., Telles, G.P.: Genome comparison on succinct colored de bruijn graphs. In: Proc. SPIRE 2022, 165\u2013177 (2022)","DOI":"10.1007\/978-3-031-20643-6_12"},{"issue":"1","key":"467_CR36","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1146\/annurev-animal-020518-115344","volume":"7","author":"ES Rice","year":"2019","unstructured":"Rice, E.S., Green, R.E.: New approaches for genome assembly and scaffolding. Ann. Rev. Anim. Biosci. 7(1), 17\u201340 (2019)","journal-title":"Ann. Rev. Anim. Biosci."},{"issue":"4","key":"467_CR37","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/s40484-019-0181-x","volume":"7","author":"R Rizzi","year":"2019","unstructured":"Rizzi, R., Beretta, S., Patterson, M., Pirola, Y., Previtali, M., Della Vedova, G., Bonizzoni, P.: Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era. Quant. Biol. 7(4), 278\u2013292 (2019)","journal-title":"Quant. Biol."},{"issue":"1\u20132","key":"467_CR38","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DF Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci. 53(1\u20132), 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"key":"467_CR39","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1186\/1471-2105-6-102","volume":"6","author":"MS Rosenberg","year":"2005","unstructured":"Rosenberg, M.S.: Evolutionary distance estimation and fidelity of pair wise sequence alignment. BMC Bioinform. 6, 102 (2005)","journal-title":"BMC Bioinform."},{"issue":"4","key":"467_CR40","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4(4), 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"issue":"2","key":"467_CR41","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.compbiolchem.2008.11.003","volume":"33","author":"K Scheibye-Alsing","year":"2009","unstructured":"Scheibye-Alsing, K., Hoffmann, S., Frankel, A., Jensen, P., Stadler, P.F., Mang, Y., Tommerup, N., Gilchrist, M.J., Nyg\u00e5rd, A.-B., Cirera, S., et al.: Sequence assembly. Comput. Biol. Chem. 33(2), 121\u2013136 (2009)","journal-title":"Comput. Biol. Chem."},{"key":"467_CR42","volume-title":"Introduction to Computational Molecular Biology","author":"JC Setubal","year":"1997","unstructured":"Setubal, J.C., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Pub, Boston (1997)"},{"issue":"3","key":"467_CR43","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1101\/gr.126953.111","volume":"22","author":"JT Simpson","year":"2012","unstructured":"Simpson, J.T., Durbin, R.: Efficient de novo assembly of large genomes using compressed data structures. Genome Res. 22(3), 549\u2013556 (2012)","journal-title":"Genome Res."},{"issue":"D1","key":"467_CR44","doi-asserted-by":"crossref","first-page":"D759","DOI":"10.1093\/nar\/gky1003","volume":"47","author":"J Thurmond","year":"2018","unstructured":"Thurmond, J., Goodman, J.L., Strelets, V.B., Attrill, H., Gramates, L.S., Marygold, S.J., Matthews, B.B., Millburn, G., Antonazzo, G., Trovisco, V., Kaufman, T.C., Calvi, B.R., FlyBase Consortium, the: FlyBase 2.0: the next generation. Nucleic Acids Res. 47(D1), D759\u2013D765 (2018)","journal-title":"Nucleic Acids Res."},{"issue":"4","key":"467_CR45","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1016\/j.jtbi.2009.10.033","volume":"262","author":"L Yang","year":"2010","unstructured":"Yang, L., Zhang, X., Wang, T.: The Burrows\u2013Wheeler similarity distribution between biological sequences based on Burrows\u2013Wheeler transform. J. Theor. Biol. 262(4), 742\u2013749 (2010)","journal-title":"J. Theor. Biol."},{"issue":"1","key":"467_CR46","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1093\/bioinformatics\/bts567","volume":"29","author":"Z Zhu","year":"2013","unstructured":"Zhu, Z., Niu, B., Chen, J., Sitao, W., Sun, S., Li, W.: Mgaviewer: a desktop visualization tool for analysis of metagenomics alignment data. Bioinform. 29(1), 122\u2013123 (2013)","journal-title":"Bioinform."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00467-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-024-00467-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-024-00467-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:45:13Z","timestamp":1743126313000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-024-00467-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,21]]},"references-count":46,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["467"],"URL":"https:\/\/doi.org\/10.1007\/s00236-024-00467-7","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2024,11,21]]},"assertion":[{"value":"1 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"1"}}