{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:05Z","timestamp":1759639025215},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232100"},{"type":"electronic","value":"9783540302131"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30213-1_3","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:26:07Z","timestamp":1285097167000},"page":"18-29","source":"Crossref","is-referenced-by-count":1,"title":["Automaton-Based Sublinear Keyword Pattern Matching"],"prefix":"10.1007","author":[{"given":"Loek","family":"Cleophas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce W.","family":"Watson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerard","family":"Zwaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0167-6423(96)00008-1","volume":"27","author":"B.W. Watson","year":"1996","unstructured":"Watson, B.W., Zwaan, G.: A taxonomy of sublinear multiple keyword pattern matching algorithms. Science of Computer Programming\u00a027, 85\u2013118 (1996)","journal-title":"Science of Computer Programming"},{"key":"3_CR2","unstructured":"Watson, B.W.: Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Faculty of Computing Science, Technische Universiteit Eindhoven (1995)"},{"key":"3_CR3","volume-title":"Jewels of Stringology - Text Algorithms","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology - Text Algorithms. World Scientific Publishing, Singapore (2003)"},{"key":"3_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195113679.001.0001","volume-title":"Pattern Matching Algorithms","author":"A. Apostolico","year":"1997","unstructured":"Apostolico, A., Galil, Z.: Pattern Matching Algorithms. Oxford University Press, Oxford (1997)"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up two string matching algorithms. Algorithmica\u00a012, 247\u2013267 (1994)","journal-title":"Algorithmica"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-48194-X_5","volume-title":"Combinatorial Pattern Matching","author":"C. Allauzen","year":"2001","unstructured":"Allauzen, C., Crochemore, M., Raffinot, M.: Efficient Experimental String Matching by Weak Factor Recognition. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol.\u00a02089, pp. 51\u201372. Springer, Heidelberg (2001)"},{"key":"3_CR7","unstructured":"Allauzen, C., Raffinot, M.: Oracle des facteurs d\u2019un ensemble de mots. Technical Report 99-11, Institut Gaspard-Monge, Universit\u00e9 de Marne-la-Vall\u00e9e (1999)"},{"key":"3_CR8","unstructured":"Cleophas, L.G.: Towards SPARE Time: A New Taxonomy and Toolkit of Keyword Pattern Matching Algorithms. Master\u2019s thesis, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (2003)"},{"key":"3_CR9","unstructured":"Cleophas, L., Watson, B.W., Zwaan, G.: A new taxonomy of sublinear keyword pattern matching algorithms. Technical Report 04\/07, Department of Mathematics and Computer Science, Technische Universiteit Eindhoven (2004)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1002\/spe.590","volume":"34","author":"B.W. Watson","year":"2004","unstructured":"Watson, B.W., Cleophas, L.: SPARE Parts: A C++ toolkit for String PAttern REcognition. Software \u2013 Practice & Experience\u00a034, 697\u2013710 (2004)","journal-title":"Software \u2013 Practice & Experience"},{"key":"3_CR11","unstructured":"Jonkers, H.: Abstraction, specification and implementation techniques, with an application to garbage collection. Technical Report 166, Mathematisch Centrum, Amsterdam (1983)"},{"key":"3_CR12","unstructured":"Watson, B.W.: Constructing minimal acyclic deterministic finite automata. PhD thesis, Department of Computer Science, University of Pretoria (2004)"},{"key":"3_CR13","unstructured":"Barla-Szabo, G.: A taxonomy of graph representations. Master\u2019s thesis, Department of Computer Science, University of Pretoria (2002)"},{"key":"3_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-3228-5","volume-title":"Predicate Calculus and Program Semantics","author":"E.W. Dijkstra","year":"1990","unstructured":"Dijkstra, E.W., Scholten, C.S.: Predicate Calculus and Program Semantics. Springer, New York (1990)"},{"key":"3_CR15","volume-title":"A Discipline of Programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice Hall, Englewood Cliffs (1976)"},{"key":"3_CR16","unstructured":"van den Eijnde, J.: Program derivation in acyclic graphs and related problems. Technical Report 92\/04, Faculty of Computing Science, Technische Universiteit Eindhoven (1992)"},{"key":"3_CR17","first-page":"71","volume-title":"Proceedings of the Prague Stringology Club Workshop 2000, Department of Computer Science and Engineering","author":"B.W. Watson","year":"2000","unstructured":"Watson, B.W.: A new family of Commentz-Walter-style multiple-keyword pattern matching algorithms. In: Proceedings of the Prague Stringology Club Workshop 2000, Department of Computer Science and Engineering, pp. 71\u201376. Czech Technical University, Prague (2000)"},{"key":"3_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences","author":"G. Navarro","year":"2002","unstructured":"Navarro, G., Raffinot, M.: Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge (2002)"},{"key":"3_CR19","volume-title":"Proceedings of the Prague Stringology Conference 2003, Department of Computer Science and Engineering","author":"L. Cleophas","year":"2003","unstructured":"Cleophas, L., Zwaan, G., Watson, B.W.: Constructing Factor Oracles. In: Proceedings of the Prague Stringology Conference 2003, Department of Computer Science and Engineering, Czech Technical University, Prague (2003)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30213-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T10:58:39Z","timestamp":1636541919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30213-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232100","9783540302131"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30213-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}