{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:33:40Z","timestamp":1743039220499,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319199283"},{"type":"electronic","value":"9783319199290"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19929-0_2","type":"book-chapter","created":{"date-parts":[[2015,6,15]],"date-time":"2015-06-15T13:09:49Z","timestamp":1434373789000},"page":"13-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Framework for Space-Efficient String Kernels"],"prefix":"10.1007","author":[{"given":"Djamal","family":"Belazzougui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Cunial","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,16]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-12476-1_2","volume-title":"Algorithms and Applications","author":"A Apostolico","year":"2010","unstructured":"Apostolico, A.: Maximal words in sequence comparisons based on subword composition. In: Elomaa, T., Mannila, H., Orponen, P. (eds.) Ukkonen Festschrift 2010. LNCS, vol. 6060, pp. 34\u201344. Springer, Heidelberg (2010)"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1186\/1748-7188-3-13","volume":"3","author":"A Apostolico","year":"2008","unstructured":"Apostolico, A., Denas, O.: Fast algorithms for computing sequence distances by exhaustive substring composition. Algorithms Mol. Biol. 3(1), 13 (2008)","journal-title":"Algorithms Mol. Biol."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Belazzougui, D.: Linear time construction of compressed text indices in compact space. In Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May\u201303 June, pp. 148\u2013193 (2014)","DOI":"10.1145\/2591796.2591885"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jda.2012.07.005","volume":"18","author":"D Belazzougui","year":"2013","unstructured":"Belazzougui, D., Navarro, G., Valenzuela, D.: Improved compressed indexes for full-text document retrieval. J. Discret. Algorithms 18, 3\u201313 (2013)","journal-title":"J. Discret. Algorithms"},{"key":"2_CR5","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. Theoret. Comput. Sci. 450, 109\u2013116 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1093\/bioinformatics\/btt310","volume":"30","author":"R Chikhi","year":"2014","unstructured":"Chikhi, R., Medvedev, P.: Informed and automated $$k$$-mer size selection for genome assembly. Bioinformatics 30(1), 31\u201337 (2014)","journal-title":"Bioinformatics"},{"issue":"10","key":"2_CR7","doi-asserted-by":"publisher","first-page":"R108","DOI":"10.1186\/gb-2009-10-10-r108","volume":"10","author":"B Chor","year":"2009","unstructured":"Chor, B., Horn, D., Goldman, N., Levy, Y., Massingham, T., et al.: Genomic DNA $$k$$-mer spectra: models and modalities. Genome Biol. 10(10), R108 (2009)","journal-title":"Genome Biol."},{"issue":"3","key":"2_CR8","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(3), 111\u2013117 (1998)","journal-title":"Inf. Process. Lett."},{"key":"2_CR9","unstructured":"Gog, S.: Compressed suffix trees: design, construction, and applications. Ph.D. thesis, University of Ulm, Germany (2011)"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1186\/1471-2105-9-167","volume":"9","author":"J Herold","year":"2008","unstructured":"Herold, J., Kurtz, S., Giegerich, R.: Efficient computation of absent words in genomic sequences. BMC Bioinform. 9(1), 167 (2008)","journal-title":"BMC Bioinform."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/978-3-319-07566-2_18","volume-title":"Combinatorial Pattern Matching","author":"AM \u0130leri","year":"2014","unstructured":"\u0130leri, A.M., K\u00fclekci, M.O., Xu, B.: Shortest unique substring query revisited. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 172\u2013181. Springer, Heidelberg (2014)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00239-003-2493-7","volume":"58","author":"J Qi","year":"2004","unstructured":"Qi, J., Wang, B., Hao, B.-I.: Whole proteome prokaryote phylogeny without sequence alignment: a $$k$$-string composition approach. J. Mol. Evol. 58(1), 1\u201311 (2004)","journal-title":"J. Mol. Evol."},{"issue":"12","key":"2_CR13","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1089\/cmb.2009.0198","volume":"16","author":"G Reinert","year":"2009","unstructured":"Reinert, G., Chew, D., Sun, F., Waterman, M.S.: Alignment-free sequence comparison (I): statistics and power. J. Comput. Biol. 16(12), 1615\u20131634 (2009)","journal-title":"J. Comput. Biol."},{"key":"2_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, Cambridge (2004)"},{"issue":"8","key":"2_CR15","doi-asserted-by":"publisher","first-page":"2677","DOI":"10.1073\/pnas.0813249106","volume":"106","author":"GE Sims","year":"2009","unstructured":"Sims, G.E., Jun, S.-R., Wu, G.A., Kim, S.-H.: Alignment-free genome comparison with feature frequency profiles (FFP) and optimal resolutions. Proc. Natl. Acad. Sci. 106(8), 2677\u20132682 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2_CR16","first-page":"585","volume-title":"Advances in Neural Information Processing Systems 15","author":"AJ Smola","year":"2003","unstructured":"Smola, A.J., Vishwanathan, S.V.N.: Fast kernels for string and tree matching. In: Becker, S., Thrun, S., Obermayer, K. (eds.) Advances in Neural Information Processing Systems 15, pp. 585\u2013592. MIT Press, Cambridge (2003)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19929-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T13:22:25Z","timestamp":1674566545000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19929-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319199283","9783319199290"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19929-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}