{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:52Z","timestamp":1759639012141,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319651712"},{"type":"electronic","value":"9783319651729"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-65172-9_49","type":"book-chapter","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T00:38:54Z","timestamp":1501547934000},"page":"583-595","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Identification of k-Closed Strings"],"prefix":"10.1007","author":[{"given":"Hayam","family":"Alamro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mai","family":"Alzamel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Watts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,2]]},"reference":[{"issue":"1","key":"49_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/s13015-017-0094-z","volume":"12","author":"Y Almirantis","year":"2017","unstructured":"Almirantis, Y., Charalampopoulos, P., Gao, J., Iliopoulos, C.S., Mohamed, M., Pissis, S.P., Polychronopoulos, D.: On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12(1), 5 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"49_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.dam.2016.04.009","volume":"212","author":"G Badkobeh","year":"2016","unstructured":"Badkobeh, G., Bannai, H., Goto, K., Tomohiro, I., Iliopoulos, C.S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed factorization. Discret. Appl. Math. 212, 23\u201329 (2016). Stringology Algorithms","journal-title":"Discret. Appl. Math."},{"key":"49_CR3","unstructured":"Badkobeh, G., Fici, G., Lipt\u00e1k, Z.: A note on words with the smallest number of closed factors. CoRR, abs\/1305.6395 (2013)"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-19315-1_5","volume-title":"Combinatorial Algorithms","author":"C Barton","year":"2015","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P., Smyth, W.F.: Fast and simple computations using prefix tables under hamming and edit distance. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 49\u201361. Springer, Cham (2015). doi:\n10.1007\/978-3-319-19315-1_5"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000). doi:\n10.1007\/10719839_9"},{"key":"49_CR6","doi-asserted-by":"crossref","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, Cambridge (2007)"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: 38th Annual Symposium on Foundations of Computer Science, Proceedings, pp. 137\u2013143. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"Fici, G.: A classification of trapezoidal words. In: Proceedings 8th International Conference Words 2011, Prague, Electronic Proceedings in Theoretical Computer Science, vol. 63, pp. 129\u2013137 (2011)","DOI":"10.4204\/EPTCS.63.18"},{"issue":"4","key":"49_CR9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/8307.8309","volume":"17","author":"Z Galil","year":"1986","unstructured":"Galil, Z., Giancarlo, R.: Improved string matching with \n            $$k$$\n           mismatches. SIGACT News 17(4), 52\u201354 (1986)","journal-title":"SIGACT News"},{"key":"49_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-07959-2_28","volume-title":"Experimental Algorithms","author":"S Gog","year":"2014","unstructured":"Gog, S., Beller, T., Moffat, A., Petri, M.: From theory to practice: plug and play with succinct data structures. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 326\u2013337. Springer, Cham (2014). doi:\n10.1007\/978-3-319-07959-2_28"},{"key":"49_CR11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(86)90178-7","volume":"43","author":"GM Landau","year":"1986","unstructured":"Landau, G.M., Vishkin, U.: Efficient string matching with \n            $$k$$\n           mismatches. Theoret. Comput. Sci. 43, 239\u2013249 (1986)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Communications in Computer and Information Science","Engineering Applications of Neural Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-65172-9_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,8]],"date-time":"2017-08-08T13:40:25Z","timestamp":1502199625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-65172-9_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319651712","9783319651729"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-65172-9_49","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}