{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:40:09Z","timestamp":1746265209988,"version":"3.40.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_27","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:44:25Z","timestamp":1402418665000},"page":"315-325","source":"Crossref","is-referenced-by-count":5,"title":["Approximate Online Matching of Circular Strings"],"prefix":"10.1007","author":[{"given":"Tommi","family":"Hirvola","sequence":"first","affiliation":[]},{"given":"Jorma","family":"Tarhio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"10","key":"27_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Bliven, S., Prlic, A.: Circular permutation in proteins. PLoS Computational Biology\u00a08(3) (2012)","DOI":"10.1371\/journal.pcbi.1002445"},{"issue":"10","key":"27_CR3","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Comm. ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Comm. ACM"},{"issue":"12","key":"27_CR4","doi-asserted-by":"publisher","first-page":"1797","DOI":"10.1016\/0031-3203(93)90177-X","volume":"26","author":"H. Bunke","year":"1993","unstructured":"Bunke, H., B\u00fchler, U.: Applications of approximate string matching to 2D shape recognition. Pattern Recognition\u00a026(12), 1797\u20131812 (1993)","journal-title":"Pattern Recognition"},{"issue":"4\/5","key":"27_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"W.I. Chang","year":"1994","unstructured":"Chang, W.I., Lawler, E.L.: Sublinear approximate string matching and biological applications. Algorithmica\u00a012(4\/5), 327\u2013344 (1994)","journal-title":"Algorithmica"},{"key":"27_CR6","unstructured":"Chen, K.H., Huang, G.S., Lee, R.C.T.: Exact circular pattern matching using the bit-parallelism and q-gram technique. In: Proc. of the 29th Workshop on Combinatorial Mathematics and Computation Theory, pp. 18\u201327. National Taipei College of Business (2012)"},{"issue":"4","key":"27_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.ipl.2009.11.010","volume":"110","author":"B. \u010eurian","year":"2010","unstructured":"\u010eurian, B., Holub, J., Peltola, H., Tarhio, J.: Improving practical exact string matching. Information Processing Letters\u00a0110(4), 148\u2013152 (2010)","journal-title":"Information Processing Letters"},{"key":"27_CR8","unstructured":"Faro, S., Lecroq, T.: Smart: a string matching algorithm research tool. University of Catania and Univeristy of Rouen (2011), http:\/\/www.dmi.unict.it\/~faro\/smart\/"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"Fredriksson, K., Navarro, N.: Average-optimal single and multiple approximate string matching. ACM Journal of Experimental Algorithmics\u00a09, article 1.4 (2004)","DOI":"10.1145\/1005813.1041513"},{"key":"27_CR10","unstructured":"Fulwider, S., Mukherjee, A.: Multiple Pattern Matching. In: The Second International Conferences on Pervasive Patterns and Applications, PATTERNS 2010, pp. 78\u201383 (2010)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/34.192484","volume":"15","author":"J. Gregor","year":"1993","unstructured":"Gregor, J., Thomason, M.G.: Dynamic programming alignment of sequences representing cyclic patterns. IEEE Trans. Pattern Anal. Mach. Intell.\u00a015, 129\u2013135 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574931"},{"issue":"3","key":"27_CR13","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.compenvurbsys.2010.08.001","volume":"35","author":"Y. Huh","year":"2011","unstructured":"Huh, Y., Yu, K., Heo, J.: Detecting conjugate-point pairs for map alignment between two polygon datasets. Computers, Environment and Urban Systems\u00a035(3), 250\u2013262 (2011)","journal-title":"Computers, Environment and Urban Systems"},{"issue":"3","key":"27_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s00453-004-1108-z","volume":"41","author":"H. Hyyr\u00f6","year":"2005","unstructured":"Hyyr\u00f6, H., Navarro, G.: Bit-parallel witnesses and their applications to approximate string matching. Algorithmica\u00a041(3), 203\u2013231 (2005)","journal-title":"Algorithmica"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-38527-8_14","volume-title":"Experimental Algorithms","author":"J. K\u00e4rkk\u00e4inen","year":"2013","unstructured":"K\u00e4rkk\u00e4inen, J., Kempa, D., Puglisi, S.J.: Lightweight Lempel-Ziv parsing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 139\u2013150. Springer, Heidelberg (2013)"},{"issue":"7","key":"27_CR16","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1093\/comjnl\/bxr126","volume":"55","author":"J. Lin","year":"2012","unstructured":"Lin, J., Adjeroh, D.: All-against-all circular pattern matching. Computer Journal\u00a055(7), 897\u2013906 (2012)","journal-title":"Computer Journal"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Lo, W.C., Lee, C.C., Lee, C.Y., Lyu, P.C.: CPDB: A database of circular permutation in proteins. Nucleic Acids Research\u00a037(suppl. 1), D328\u2013D332 (2009)","DOI":"10.1093\/nar\/gkn679"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Marzal, A., Barrachina, S.: Speeding up the computation of the edit distance for cyclic strings. In: Int\u2019l Conference on Pattern Recognition, pp. 891\u2013894. IEEE Computer Society Press (2000)","DOI":"10.1109\/ICPR.2000.906217"},{"issue":"3","key":"27_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"G. Myers","year":"1999","unstructured":"Myers, G.: A fast bit-vector algorithm for approximate string matching based on dynamic programming. Journal of the ACM\u00a046(3), 395\u2013415 (1999)","journal-title":"Journal of the ACM"},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. Journal of Experimental Algorithmics\u00a05 (2000)","DOI":"10.1145\/351827.384246"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv.\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"13","key":"27_CR22","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1002\/spe.411","volume":"31","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: NR-grep: A fast and flexible pattern-matching tool. Softw. Pract. Exp.\u00a031(13), 1265\u20131312 (2001)","journal-title":"Softw. Pract. Exp."},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Oncina, J.: The Cocke-Younger-Kasami algorithm for cyclic strings. In: ICPR 1996: Proc. 13th Int. Conf. Pattern Recognition, Vienna, Austria, pp. 413\u2013416. IEEE Computer Society (1996)","DOI":"10.1109\/ICPR.1996.546859"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-39984-1_7","volume-title":"String Processing and Information Retrieval","author":"H. Peltola","year":"2003","unstructured":"Peltola, H., Tarhio, J.: Alternative algorithms for bit-parallel string matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 80\u201393. Springer, Heidelberg (2003)"},{"key":"27_CR25","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ic.2011.03.007","volume":"213","author":"T. Schnattinger","year":"2012","unstructured":"Schnattinger, T., Ohlebusch, E., Gog, S.: Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Information and Computation\u00a0213, 13\u201322 (2012)","journal-title":"Information and Computation"},{"key":"27_CR26","series-title":"AISC","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-319-02309-0_59","volume-title":"Man-Machine Interactions 3","author":"R. Susik","year":"2014","unstructured":"Susik, R., Grabowski, S., Deorowicz, S.: Fast and simple circular pattern matching. In: Gruca, A., Czach\u00f3rski, T., Kozielski, S. (eds.) Man-Machine Interactions 3. AISC, vol.\u00a0242, pp. 541\u2013548. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:04:17Z","timestamp":1746263057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}