{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:46Z","timestamp":1760202706085},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_25","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"334-346","source":"Crossref","is-referenced-by-count":9,"title":["Linear-Time Sequence Comparison Using Minimal Absent Words & Applications"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Gabriele","family":"Fici","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"10","key":"25_CR1","doi-asserted-by":"publisher","first-page":"e1022","DOI":"10.1371\/journal.pone.0001022","volume":"2","author":"C Acquisti","year":"2007","unstructured":"Acquisti, C., Poste, G., Curtiss, D., Kumar, S.: Nullomers: really a matter of natural selection? PLoS ONE 2(10), e1022 (2007)","journal-title":"PLoS ONE"},{"key":"25_CR2","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., Pissis, S.P.: Linear-time computation of minimal absent words using suffix array. BMC Bioinform. 15, 388 (2014)","journal-title":"BMC Bioinform."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Barton, C., Heliou, A., Mouchard, L., Pissis, S.P.: Parallelising the computation of minimal absent words. In: PPAM, LNCS. Springer, Heidelberg (2015)","DOI":"10.1007\/978-3-319-32152-3_23"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-20086-6_19","volume-title":"Experimental Algorithms","author":"C Barton","year":"2015","unstructured":"Barton, C., Iliopoulos, C.S., Kundu, R., Pissis, S.P., Retha, A., Vayani, F.: Accurate and efficient methods to improve multiple circular sequence alignment. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 247\u2013258. Springer, Heidelberg (2015)"},{"issue":"2","key":"25_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1006\/aama.2000.0682","volume":"25","author":"M B\u00e9al","year":"2000","unstructured":"B\u00e9al, M., Mignosi, F., Restivo, A., Sciortino, M.: Forbidden words in symbolic dynamics. Adv. Appl. Math. 25(2), 163\u2013193 (2000)","journal-title":"Adv. Appl. Math."},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-40450-4_12","volume-title":"Algorithms \u2013 ESA 2013","author":"D Belazzougui","year":"2013","unstructured":"Belazzougui, D., Cunial, F., K\u00e4rkk\u00e4inen, J., M\u00e4kinen, V.: Versatile succinct representations of the bidirectional burrows-wheeler transform. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 133\u2013144. Springer, Heidelberg (2013)"},{"key":"25_CR7","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":"25_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, New York, NY, USA (2007)"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inf. Process. Lett. 67, 111\u2013117 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"24","key":"25_CR10","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1093\/bioinformatics\/btp590","volume":"25","author":"M Domazet-Lo\u0161o","year":"2009","unstructured":"Domazet-Lo\u0161o, M., Haubold, B.: Efficient estimation of pairwise distances between genomes. Bioinformatics 25(24), 3221\u20133227 (2009)","journal-title":"Bioinformatics"},{"key":"25_CR11","unstructured":"Fici, G.: Minimal Forbidden Words and Applications. Ph.D. thesis, Universit\u00e9 de Marne-la-Vall\u00e9e (2006)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-22300-6_32","volume-title":"Algorithms and Data Structures","author":"J Fischer","year":"2011","unstructured":"Fischer, J.: Inducing the LCP-array. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 374\u2013385. Springer, Heidelberg (2011)"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1137\/090779759","volume":"40","author":"J Fischer","year":"2011","unstructured":"Fischer, J., Heun, V.: Space-efficient preprocessing schemes for range minimum queries on static arrays. SIAM J. Comput. 40(2), 465\u2013492 (2011)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1093\/molbev\/msp098","volume":"26","author":"W Fletcher","year":"2009","unstructured":"Fletcher, W., Yang, Z.: INDELible: a flexible simulator of biological sequence evolution. Mol. Biol. Evol. 26(8), 1879\u20131888 (2009)","journal-title":"Mol. Biol. Evol."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Fukae, H., Ota, T., Morita, H.: On fast and memory-efficient construction of an antidictionary array. In: ISIT, pp. 1092\u20131096. IEEE (2012)","DOI":"10.1109\/ISIT.2012.6283021"},{"issue":"1","key":"25_CR16","doi-asserted-by":"publisher","first-page":"e16065","DOI":"10.1371\/journal.pone.0016065","volume":"6","author":"SP Garcia","year":"2011","unstructured":"Garcia, S.P., Pinho, A.J., Rodrigues, J.M.O.S., Bastos, C.A.C., Ferreira, P.J.S.G.: Minimal absent words in prokaryotic and eukaryotic genomes. PLoS ONE 6(1), e16065 (2011)","journal-title":"PLoS ONE"},{"issue":"3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1101\/gr.5941007","volume":"17","author":"A Goios","year":"2007","unstructured":"Goios, A., Pereira, L., Bogue, M., Macaulay, V., Amorim, A.: mtDNA phylogeny and evolution of laboratory mouse strains. Genome Res. 17(3), 293\u2013298 (2007)","journal-title":"Genome Res."},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-48221-6_15","volume-title":"Algorithms in Bioinformatics","author":"R Grossi","year":"2015","unstructured":"Grossi, R., Iliopoulos, C.S., Merca\u015f, R., Pisanti, N., Pissis, S.P., Retha, A., Vayani, F.: Circular sequence comparison with q-grams. In: Pop, M., Touzet, H. (eds.) WABI 2015. LNCS, vol. 9289, pp. 203\u2013216. Springer, Heidelberg (2015)"},{"issue":"4","key":"25_CR19","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.jda.2010.08.004","volume":"8","author":"L Ilie","year":"2010","unstructured":"Ilie, L., Navarro, G., Tinta, L.: The longest common extension problem revisited and applications to approximate string searching. J. Discrete Algorithms 8(4), 418\u2013428 (2010)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1137\/S0097539794264810","volume":"27","author":"GM Landau","year":"1998","unstructured":"Landau, G.M., Myers, E.W., Schmidt, J.P.: Incremental string comparison. SIAM J. Comput. 27(2), 557\u2013582 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90109-B","volume":"35","author":"M Maes","year":"1990","unstructured":"Maes, M.: On a cyclic string-to-string correction problem. Inf. Process. Lett. 35(2), 73\u201378 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"25_CR22","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U Manber","year":"1993","unstructured":"Manber, U., Myers, E.W.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935\u2013948 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"25_CR23","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0304-3975(00)00436-9","volume":"273","author":"F Mignosi","year":"2002","unstructured":"Mignosi, F., Restivo, A., Sciortino, M.: Words and forbidden factors. Theor. Comput. Sci. 273(1\u20132), 99\u2013117 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR24","first-page":"93","volume":"83","author":"A Mosig","year":"2006","unstructured":"Mosig, A., Hofacker, I.L., Stadler, P.F.: Comparative analysis of cyclic sequences: viroids and other small circular RNAs. GCB, LNI 83, 93\u2013102 (2006)","journal-title":"GCB, LNI"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Linear suffix array construction by almost pure induced-sorting. In: DCC, pp. 193\u2013202. IEEE (2009)","DOI":"10.1109\/DCC.2009.42"},{"key":"25_CR26","unstructured":"Ota, T., Morita, H.: On a universal antidictionary coding for stationary ergodic sources with finite alphabet. In: ISITA, pp. 294\u2013298. IEEE (2014)"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Ota, T., Morita, H.: On antidictionary coding based on compacted substring automaton. In: ISIT, pp. 1754\u20131758. IEEE (2013)","DOI":"10.1109\/ISIT.2013.6620528"},{"issue":"1","key":"25_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-1","volume":"10","author":"AJ Pinho","year":"2009","unstructured":"Pinho, A.J., Ferreira, P.J.S.G., Garcia, S.P., Rodrigues, J.M.O.S.: On finding minimal absent words. BMC Bioinform. 10(1), 1 (2009)","journal-title":"BMC Bioinform."},{"issue":"1\u20132","key":"25_CR29","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D Robinson","year":"1981","unstructured":"Robinson, D., Fould, L.: Comparison of phylogenetic trees. Math. Biosci. 53(1\u20132), 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"issue":"4","key":"25_CR30","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":"15","key":"25_CR31","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.S.G.: Three minimal sequences found in Ebola virus genomes and absent from human DNA. Bioinformatics 31(15), 2421\u20132425 (2015)","journal-title":"Bioinformatics"},{"issue":"1","key":"25_CR32","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(92)90143-4","volume":"92","author":"E Ukkonen","year":"1992","unstructured":"Ukkonen, E.: Approximate string-matching with \n                    \n                      \n                    \n                    $$q$$\n                    \n                      \n                        q\n                      \n                    \n                  -grams and maximal matches. Theor. Comput. Sci. 92(1), 191\u2013211 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-04241-6_31","volume-title":"Algorithms in Bioinformatics","author":"TJ Wheeler","year":"2009","unstructured":"Wheeler, T.J.: Large-scale neighbor-joining with NINJA. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol. 5724, pp. 375\u2013389. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:02:55Z","timestamp":1559408575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}