{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:41Z","timestamp":1725493661551},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_24","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:04:43Z","timestamp":1193457883000},"page":"222-231","source":"Crossref","is-referenced-by-count":1,"title":["A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions"],"prefix":"10.1007","author":[{"given":"Hiroaki","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Miyazaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"A.V. Aho, Algorithms for finding patterns in strings, In J.V. Leeuwen, ed. Handbook of theoretical computer science, Elsevier Science Pub., 1990.","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"A. Apostolico, Z. Galil ed., Pattern Matching Algorithms, Oxford University Press, 1997.","DOI":"10.1201\/9781420049503-c14"},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1145\/235809.235810","volume":"43","author":"R. Baeza-Yates","year":"1996","unstructured":"R. Baeza-Yates and G. Gonnet, Fast Text Searching for Regular Expressions or Automaton Searching on Tries, J. of the ACM, 43,6, 915\u2013936, 1996.","journal-title":"J. of the ACM"},{"key":"24_CR4","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval, Addison Wesley, 1999."},{"issue":"1\u20132","key":"24_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01188587","volume":"13","author":"J.R. Knight","year":"1995","unstructured":"J.R. Knight and E.W. Myers, Super-Pattern matching, Algorithmica, 13,1\u20132, 211\u2013243, 1995.","journal-title":"Algorithmica"},{"key":"24_CR6","unstructured":"S.C. Hirst, A New Algorithm Solving Membership of Extended Regular Expressions, Tech. Report, The University of Sydney, 1989."},{"key":"24_CR7","unstructured":"J.E. Hopcroft and J.D. Ullman, Introduction to automata theory language and computation, Addison Wesley, Reading Mass, 1979."},{"issue":"4","key":"24_CR8","first-page":"430","volume":"39","author":"G. Myers","year":"1992","unstructured":"G. Myers, A Four Russians Algorithm for Regular Expression Pattern Matching, J. of the ACM, 39,4, 430\u2013448, 1992.","journal-title":"J. of the ACM"},{"issue":"1","key":"24_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02458834","volume":"51","author":"E. Myers","year":"1989","unstructured":"E. Myers and W. Miller, Approximate Matching of Regular Expressions, Bull. of Mathematical Biology, 51,1, 5\u201337, 1989.","journal-title":"Bull. of Mathematical Biology"},{"key":"24_CR10","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. WAE2001","author":"G. Navarro","year":"2001","unstructured":"G. Navarro and M. Raffinot, Compact DFA Representation for Fast Regular Expression Search, Proc. WAE2001, LNCS 2141, 1\u201312, 2001."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/jagm.1995.1041","volume":"19","author":"S. Wu","year":"1995","unstructured":"S. Wu, U. Manber and E. Myers, A Sub-Quadratic Algorithm for Approximate Regular Expression Matching, J. of Algorithm, 19, 346\u2013360, 1995.","journal-title":"J. of Algorithm"},{"key":"24_CR12","series-title":"Lect Notes Comput Sci","first-page":"267","volume-title":"Proc. ISAAC2001","author":"H. Yamamoto","year":"2001","unstructured":"H. Yamamoto, A New Recognition Algorithm for Extended Regular Expressions, Proc. ISAAC2001, LNCS 2223, 267\u2013277, 2001."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:09:19Z","timestamp":1556921359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}