{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:16:59Z","timestamp":1743106619295,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"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-15579-1_6","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"85-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Average-Case Optimal Approximate Circular String Matching"],"prefix":"10.1007","author":[{"given":"Carl","family":"Barton","sequence":"first","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"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Barton, C., Iliopoulos, C.S., Pissis, S.P.: Fast algorithms for approximate circular string matching. Algorithms for Molecular Biology 9(1), 9 (2014). http:\/\/www.almob.org\/content\/9\/1\/9","DOI":"10.1186\/1748-7188-9-9"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-58094-8_23","volume-title":"Combinatorial Pattern Matching","author":"WI Chang","year":"1994","unstructured":"Chang, W.I., Marr, T.G.: Approximate string matching and local similarity. In: Crochemore, M., Gusfield, D. (eds.) CPM 1994. LNCS, vol. 807, pp. 259\u2013273. Springer, Heidelberg (1994)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Chen, K.H., Huang, G.S., Lee, R.C.T.: Bit-Parallel Algorithms for Exact Circular String Matching. The Computer Journal (2013)","DOI":"10.1093\/comjnl\/bxt023"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, New York (2007)","DOI":"10.1017\/CBO9780511546853"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1471-2105-10-230","volume":"10","author":"F Fernandes","year":"2009","unstructured":"Fernandes, F., Pereira, L., Freitas, A.T.: CSA: An efficient algorithm to improve circular DNA multiple alignment. BMC Bioinformatics 10(1), 1\u201313 (2009)","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/j.jda.2008.09.001","volume":"7","author":"K Fredriksson","year":"2009","unstructured":"Fredriksson, K., Grabowski, S.: Average-optimal string matching. Journal of Discrete Algorithms 7(4), 579\u2013594 (2009)","journal-title":"Journal of Discrete Algorithms"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Fredriksson, K., M\u00e4kinen, V., Navarro, G.: Flexible music retrieval in sublinear time. International Journal of Foundations of Computer Science 17(06), 1345\u20131364 (2006). http:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004455","DOI":"10.1142\/S0129054106004455"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Fredriksson, K., Navarro, G.: Average-optimal single and multiple approximate string matching. Journal of Experimental Algorithmics 9, December 2004. http:\/\/doi.acm.org\/10.1145\/1005813.1041513","DOI":"10.1145\/1005813.1041513"},{"key":"6_CR9","unstructured":"Gusfield, D.: Algorithms on Strings. Cambridge University Press, Trees and Sequences (1997)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-07959-2_27","volume-title":"Experimental Algorithms","author":"T Hirvola","year":"2014","unstructured":"Hirvola, T., Tarhio, J.: Approximate online matching of circular strings. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 315\u2013325. Springer, Heidelberg (2014)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1007\/978-3-642-10631-6_109","volume-title":"Algorithms and Computation","author":"P-H Hsu","year":"2009","unstructured":"Hsu, P.-H., Chen, K.-Y., Chao, K.-M.: Finding all approximate gapped palindromes. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 1084\u20131093. Springer, Heidelberg (2009)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-77891-2_5","volume-title":"WALCOM: Algorithms and Computation","author":"CS Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Rahman, M.S.: Indexing circular patterns. In: Nakano, S., Rahman, M.S. (eds.) WALCOM 2008. LNCS, vol. 4921, pp. 46\u201357. Springer, Heidelberg (2008)"},{"issue":"2","key":"6_CR13","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 Journal of Computing 27(2), 557\u2013582 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-13509-5_28","volume-title":"Combinatorial Pattern Matching","author":"T Lee","year":"2010","unstructured":"Lee, T., Na, J.C., Park, H., Park, K., Sim, J.S.: Finding optimal alignment and consensus of circular strings. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol. 6129, pp. 310\u2013322. Springer, Heidelberg (2010)"},{"key":"6_CR15","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Tech. Rep. 8 (1966)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press (2005)","DOI":"10.1017\/CBO9781107341005"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/3-540-12689-9_129","volume-title":"Foundations of Computation Theory","author":"E Ukkonen","year":"1983","unstructured":"Ukkonen, E.: On approximate string matching. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 487\u2013495. Springer, Heidelberg (1983)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T04:14:49Z","timestamp":1676434489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_6","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":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}