{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:23Z","timestamp":1725577403527},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_6","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"49-58","source":"Crossref","is-referenced-by-count":0,"title":["Finite Automata for Generalized Approach to Backward Pattern Matching"],"prefix":"10.1007","author":[{"given":"Jan","family":"Anto\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo\u0159ivoj","family":"Melichar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient String Matching: An Aid to Bibliographic Research. Communications of ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Communications of ACM"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-47849-3_18","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"C. Allauzen","year":"1999","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Factor Oracle: A New Structure for Pattern Matching. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol.\u00a01725, pp. 295\u2013306. Springer, Heidelberg (1999)"},{"key":"6_CR3","unstructured":"Anto\u0161, J.: Automaton-based Backward Pattern Matching. Dissertation thesis. CTU in Prague (2010), \n                  \n                    http:\/\/www.stringology.org\/papers\/Antos-PhD_thesis-2010.pdf"},{"issue":"10","key":"6_CR4","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. C. ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"C. ACM"},{"key":"6_CR5","unstructured":"Chvatal, V., Klarner, D.A., Knuth, D.E.: Selected Combinatorial Research Problems. STAN-CS-72-292, Stanford University (1972)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Cleophas, L., Watson, B.W., Zwaan, G.: Automaton-based sublinear keyword pattern matching. In: Proceedings of the 11th SPIRE, Padova, Italy (2004)","DOI":"10.1007\/978-3-540-30213-1_3"},{"key":"6_CR7","unstructured":"Crochemore, M., Czumaj, A.: Ga\u0327sieniec, L., et al.: Deux m\u00e9thodes pour acc\u00e9lerer l\u2019algorithme de Boyer-Moore. In: Actes des 2e Journ\u00e9es franco-belges: Th\u00e9ories des Automates et Applications, pp. 45\u201363. Public. de l\u2019Univ. de Rouen, No. 176 (1991)"},{"key":"6_CR8","doi-asserted-by":"publisher","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)"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"R.W. Hamming","year":"1950","unstructured":"Hamming, R.W.: Error-detecting and error-correcting codes. Bell System Technical Journal\u00a029(2), 147\u2013160 (1950)","journal-title":"Bell System Technical Journal"},{"key":"6_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley, Reading (2001)"},{"key":"6_CR11","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of Events in Nerve Nets and Finite Automata. In: Automata Studies, pp. 3\u201342. Princeton University Press, Princeton (1956)"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0304-3975(92)90139-7","volume":"92","author":"T. Lecroq","year":"1992","unstructured":"Lecroq, T.: A variation on the Boyer-Moore algorithm. Theoretical Computer Science\u00a092(1), 119\u2013144 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"6_CR13","first-page":"845","volume":"163","author":"V.I. Levenshtein","year":"1965","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk SSSR\u00a0163(4), 845\u2013848 (1965)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Melichar, B.: String Matching with k Differences by Finite Automata. In: Proceedings of the 13th ICPR, vol.\u00a0II, pp. 256\u2013260 (1996)","DOI":"10.1109\/ICPR.1996.546828"},{"key":"6_CR15","unstructured":"Melichar, B., Holub, J.: 6D Classification of Pattern Matching Problems. In: Proceedings of PSC 1997, Prague, Czech republic, pp. 24\u201332 (1997)"},{"key":"6_CR16","unstructured":"Melichar, B., Holub, J., Polcar, T.: Text Searching Algorithms, vol.\u00a0I, II (2005), \n                  \n                    http:\/\/psc.felk.cvut.cz\/athens\/"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T18:33:04Z","timestamp":1547749984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}