{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T22:25:58Z","timestamp":1743459958165,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319023083"},{"type":"electronic","value":"9783319023090"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-02309-0_59","type":"book-chapter","created":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T07:57:47Z","timestamp":1379577467000},"page":"537-544","source":"Crossref","is-referenced-by-count":5,"title":["Fast and Simple Circular Pattern Matching"],"prefix":"10.1007","author":[{"given":"Robert","family":"Susik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Szymon","family":"Grabowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Deorowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"10","key":"59_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., 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":"59_CR2","first-page":"152","volume-title":"Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory","author":"K.H. Chen","year":"2011","unstructured":"Chen, K.H., Huang, G.S., Lee, R.C.T.: Exact circular pattern matching using the BNDM algorithm. In: Proceedings of the 28th Workshop on Combinatorial Mathematics and Computation Theory, pp. 152\u2013161. National Penghu University of Science and Technology, Penghu (2011)"},{"key":"59_CR3","first-page":"18","volume-title":"Proceedings of the 29th Workshop on Combinatorial Mathematics and Computation Theory","author":"K.H. Chen","year":"2012","unstructured":"Chen, K.H., Huang, G.S., Lee, R.C.T.: Exact circular pattern matching using bit-parallelism and q-gram technique. In: Proceedings of the 29th Workshop on Combinatorial Mathematics and Computation Theory, pp. 18\u201327. National Taipei College of Business, Institute of Information and Decision Sciences, Taipei (2012)"},{"key":"59_CR4","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"},{"issue":"4","key":"59_CR5","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\u00a07(4), 579\u2013594 (2009)","journal-title":"Journal of Discrete Algorithms"},{"issue":"6","key":"59_CR6","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1142\/S0129054106004455","volume":"17","author":"K. Fredriksson","year":"2006","unstructured":"Fredriksson, K., M\u00e4kinen, V., Navarro, G.: Flexible music retrieval in sublinear time. International Journal of Foundations of Computer Science\u00a017(6), 1345\u20131364 (2006)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"3","key":"59_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(89)90188-9","volume":"33","author":"R. Grossi","year":"1989","unstructured":"Grossi, R., Luccio, F.: Simple and efficient string matching with k mismatches. Information Processing Letters\u00a033(3), 113\u2013120 (1989)","journal-title":"Information Processing Letters"},{"key":"59_CR8","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":"C.S. Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Rahman, M.S.: Indexing circular patterns. In: Nakano, S.-I., Rahman, M.S. (eds.) WALCOM 2008. LNCS, vol.\u00a04921, pp. 46\u201357. Springer, Heidelberg (2008)"},{"issue":"12","key":"59_CR9","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1002\/(SICI)1097-024X(199612)26:12<1439::AID-SPE71>3.0.CO;2-1","volume":"26","author":"P. Jokinen","year":"1996","unstructured":"Jokinen, P., Tarhio, J., Ukkonen, E.: A comparison of approximate string matching algorithms. Software Practice and Experience\u00a026(12), 1439\u20131458 (1996)","journal-title":"Software Practice and Experience"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press (2005)","DOI":"10.1017\/CBO9781107341005"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Navarro, G., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. Journal of Experimental Algorithms 5(4) (2000)","DOI":"10.1145\/351827.384246"},{"issue":"10","key":"59_CR12","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/TC.2010.188","volume":"60","author":"G. Nong","year":"2011","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Two efficient algorithms for linear time suffix array construction. IEEE Transactions on Computers\u00a060(10), 1471\u20131484 (2011)","journal-title":"IEEE Transactions on Computers"},{"key":"59_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-70575-8_8","volume-title":"Automata, Languages and Programming","author":"M. Ru\u017ei\u0107","year":"2008","unstructured":"Ru\u017ei\u0107, M.: Constructing efficient dictionaries in close to sorting time. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 84\u201395. Springer, Heidelberg (2008)"}],"container-title":["Advances in Intelligent Systems and Computing","Man-Machine Interactions 3"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02309-0_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T16:10:07Z","timestamp":1676823007000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-02309-0_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319023083","9783319023090"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02309-0_59","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}