{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:49:36Z","timestamp":1743094176874,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819628445"},{"type":"electronic","value":"9789819628452"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-2845-2_12","type":"book-chapter","created":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:13Z","timestamp":1740067213000},"page":"180-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Implementation of\u00a0Cosine Distance on\u00a0Minimal Absent Word Sets Using Suffix Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5786-5367","authenticated-orcid":false,"given":"Mohammad Tamimul","family":"Ehsan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5500-9743","authenticated-orcid":false,"given":"Sk. Sabit Bin","family":"Mosaddek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9887-4456","authenticated-orcid":false,"given":"M Saifur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,21]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TCBB.2021.3136792","volume":"20","author":"N Anjum","year":"2023","unstructured":"Anjum, N., Nabil, R.L., Rafi, R.I., Bayzid, M.S., Rahman, M.S.: CD-MAWS: an alignment-free phylogeny estimation method using cosine distance on minimal absent word sets. IEEE\/ACM Trans. Comput. Biol. Bioinform. 20(1), 196\u2013205 (2023). https:\/\/doi.org\/10.1109\/TCBB.2021.3136792","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"12_CR2","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkt003","volume":"41","author":"H Yi","year":"2013","unstructured":"Yi, H., Jin, L.: Co-phylog: an assembly-free phylogenomic approach for closely related organisms. Nucleic Acids Res. 41, e75 (2013)","journal-title":"Nucleic Acids Res."},{"issue":"7","key":"12_CR3","doi-asserted-by":"publisher","first-page":"2040","DOI":"10.1093\/bioinformatics\/btz903","volume":"36","author":"F Klotzl","year":"2020","unstructured":"Klotzl, F., Haubold, B.: Phylonium: fast estimation of evolutionary distances from large samples of similar genomes. Bioinformatics 36(7), 2040\u20132046 (2020)","journal-title":"Bioinformatics"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1186\/s13059-019-1841-x","volume":"20","author":"BD Ondov","year":"2019","unstructured":"Ondov, B.D., et al.: Mash screen: high-throughput sequence containment estimation for genome discovery. Genome Biol. 20(1), 232 (2019)","journal-title":"Genome Biol."},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13059-019-1632-4","volume":"20","author":"S Sarmashghi","year":"2019","unstructured":"Sarmashghi, S., Bohmann, K., Gilbert, M.T.P., Bafna, V., Mirarab, S.: Skmer: assembly-free and alignment-free sample identification using genome skims. Genome Biol. 20(1), 1\u201320 (2019)","journal-title":"Genome Biol."},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"026004","DOI":"10.1088\/1478-3975\/13\/2\/026004","volume":"13","author":"E Aurell","year":"2016","unstructured":"Aurell, E., Innocenti, N., Zhou, H.-J.: The bulk and the tail of minimal absent words in genome sequences. Phys. Biol. 13(2), 026004 (2016)","journal-title":"Phys. Biol."},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/bioinformatics\/13.3.235","volume":"13","author":"A Rambaut","year":"1997","unstructured":"Rambaut, A., Grass, N.C.: Seq-gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees. Bioinformatics 13(3), 235\u2013238 (1997)","journal-title":"Bioinformatics"},{"issue":"5934","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1126\/science.1171243","volume":"324","author":"K Liu","year":"2009","unstructured":"Liu, K., Raghavan, S., Nelesen, S., Linder, C.R., Warnow, T.: Rapid and accurate largescale coestimation of sequence alignments and phylogenetic trees. Science 324(5934), 1561\u20131564 (2009)","journal-title":"Science"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1186\/s13059-019-1755-7","volume":"20","author":"A Zielezinski","year":"2019","unstructured":"Zielezinski, A., Girgis, H.Z., Bernard, G., et al.: Benchmarking of alignment-free sequence comparison methods. Genome Biol. 20, 144 (2019). https:\/\/doi.org\/10.1186\/s13059-019-1755-7","journal-title":"Genome Biol."},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1186\/s13059-016-0997-x","volume":"17","author":"BD Ondov","year":"2016","unstructured":"Ondov, B.D., et al.: Mash: fast genome and metagenome distance estimation using minhash. Genome Biol. 17(1), 132 (2016)","journal-title":"Genome Biol."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1093\/molbev\/msr205","volume":"29","author":"M Abeysundera","year":"2012","unstructured":"Abeysundera, M., Field, C., Gu, H.: Phylogenetic analysis based on spectral methods. Mol. Biol. Evol. 29(2), 579\u2013597 (2012). https:\/\/doi.org\/10.1093\/molbev\/msr205","journal-title":"Mol. Biol. Evol."},{"issue":"2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.bbrc.2008.01.070","volume":"368","author":"Z Liu","year":"2008","unstructured":"Liu, Z., Meng, J., Sun, X.: A novel feature-based method for whole genome phylogenetic analysis without alignment: application to HEV genotyping and subtyping. Biochem. Biophys. Res. Commun. 368(2), 223\u2013230 (2008). https:\/\/doi.org\/10.1016\/j.bbrc.2008.01.070. ISSN 0006-291X","journal-title":"Biochem. Biophys. Res. Commun."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Akon, M., Akon, M., Kabir, M., Rahman, M.S., Rahman, M.S.: ADACT: a tool for analysing (dis)similarity among nucleotide and protein sequences using minimal and relative absent words. Bioinformatics (2020). In Press","DOI":"10.1093\/bioinformatics\/btaa853"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1186\/s13104-016-1972-z","volume":"9","author":"MS Rahman","year":"2016","unstructured":"Rahman, M.S., Alatabbi, A., Athar, T., Crochemore, M., Rahman, M.S.: Absent words and the (dis)similarity analysis of DNA sequences: an experimental study. BMC. Res. Notes 9, 186 (2016)","journal-title":"BMC. Res. Notes"},{"issue":"15","key":"12_CR15","doi-asserted-by":"publisher","first-page":"2421","DOI":"10.1093\/bioinformatics\/btv189","volume":"31","author":"RM Silva","year":"2015","unstructured":"Silva, R.M., Pratas, D., Castro, L., Pinho, A.J., Ferreira, P.J.: Three minimal sequences found in Ebola virus genomes and absent from human DNA. Bioinformatics 31(15), 2421\u20132425 (2015)","journal-title":"Bioinformatics"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2012.04.031","volume":"450","author":"S Chairungsee","year":"2012","unstructured":"Chairungsee, S., Crochemore, M.: Using minimal absent words to build phylogeny. Theor. Comput. Sci. 450, 109\u2013116 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"e29344","DOI":"10.1371\/journal.pone.0029344","volume":"6","author":"SP Garcia","year":"2011","unstructured":"Garcia, S.P., Pinho, A.J.: Minimal absent words in four human genome assemblies. PLoS ONE 6, e29344 (2011)","journal-title":"PLoS ONE"},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1007\/s00453-017-0286-4","volume":"79","author":"D Belazzougui","year":"2017","unstructured":"Belazzougui, D., Cunial, F.: A framework for space efficient string kernels. Algorithmica 79(3), 857\u2013883 (2017)","journal-title":"Algorithmica"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1186\/s12859-014-0388-9","volume":"15","author":"C Barton","year":"2014","unstructured":"Barton, C., Heliou, A., Mouchard, L., et al.: Linear-time computation of minimal absent words using suffix array. BMC Bioinform. 15, 388 (2014). https:\/\/doi.org\/10.1186\/s12859-014-0388-9","journal-title":"BMC Bioinform."},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"International Human Genome Sequencing Consortium: Initial sequencing and analysis of the human genome. Nature 409, 860\u2013921 (2001). https:\/\/doi.org\/10.1038\/35057062","DOI":"10.1038\/35057062"},{"issue":"6","key":"12_CR21","doi-asserted-by":"publisher","first-page":"109889","DOI":"10.1016\/j.isci.2024.109889","volume":"27","author":"P Fern\u00e1ndez","year":"2024","unstructured":"Fern\u00e1ndez, P., et al.: A 160 Gbp fork fern genome shatters size record for eukaryotes. iScience 27(6), 109889 (2024)","journal-title":"iScience"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-13345-3_9","volume-title":"Automata, Languages and Programming","author":"A Blumer","year":"1984","unstructured":"Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., McConnell, R.: Building the minimal DFA for the set of all subwords of a word on-line in linear time. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 109\u2013118. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/3-540-13345-3_9"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg G., Salomaa A. (eds.) Handbook of Formal Languages. 2, Linear Modeling: Background and Application, pp. 399\u2013462. Springer (1997). ffhal-00620792f","DOI":"10.1007\/978-3-662-07675-0_9"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2845-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T16:00:17Z","timestamp":1740067217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2845-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819628445","9789819628452"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2845-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"21 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors state that there is no competing interest for this study.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/walcom2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}