{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:01:23Z","timestamp":1794337283915,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540513711","type":"print"},{"value":"9783540462019","type":"electronic"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035751","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T04:00:28Z","timestamp":1133409628000},"page":"46-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Efficient text searching of regular expressions"],"prefix":"10.1007","author":[{"given":"Ricardo A.","family":"Baeza-Yates","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gaston H.","family":"Gonnet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"issue":"6","key":"4_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. Aho","year":"1975","unstructured":"A. Aho and M. Corasick. Efficient string matching: An aid to bibliographic search. C.ACM, 18(6):333\u2013340, June 1975.","journal-title":"C.ACM"},{"key":"4_CR2","first-page":"325","volume-title":"Pattern Matching in Strings","author":"A. Aho","year":"1980","unstructured":"A. Aho. Pattern Matching in Strings, pages 325\u2013347. Academic Press, London, 1980."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R. Boyer","year":"1977","unstructured":"R. Boyer and S. Moore. A fast string searching algorithm. C.ACM, 20:762\u2013772, 1977.","journal-title":"C.ACM"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"B. Commentz-Walter. A string matching algorithm fast on the average. In ICALP, volume 6 of Lecture Notes in Computer Science xxx, pages 118\u2013132. Springer-Verlag, 1979.","DOI":"10.1007\/3-540-09510-1_10"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02279819","volume":"28","author":"L. Devroye","year":"1982","unstructured":"L. Devroye. A note on the average depth of tries. Computing, 28:367\u2013371, 1982.","journal-title":"Computing"},{"key":"4_CR6","first-page":"113","volume-title":"String Matching and Other Products, volume 7","author":"M. Fischer","year":"1974","unstructured":"M. Fischer and M. Paterson. String Matching and Other Products, volume 7, pages 113\u2013125. American Mathematical Society, Providence, RI, 1974."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/5383.5453","volume":"33","author":"P. Flajolet","year":"1986","unstructured":"P. Flajolet and C. Puech. Tree structures for partial match retrieval. J.ACM, 33:371\u2013407, 1986.","journal-title":"J.ACM"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Z. Galil. Open Problems in Stringology, volume F12 of NATO ASI Series, pages 1\u20138. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_1"},{"key":"4_CR9","volume-title":"The Theory of Matrices (2 Vols)","author":"F.R. Gantmacher","year":"1959","unstructured":"F.R. Gantmacher. The Theory of Matrices (2 Vols). Chelsea Publishing Company, New York, 1959."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"G.H. Gonnet. Unstructured data bases or very efficient text searching. In ACM PODS, volume 2, pages 117\u2013124, Atlanta, GA, Mar 1983.","DOI":"10.1145\/588058.588074"},{"key":"4_CR11","volume-title":"Introduction to Automata Theory","author":"J. Hopcroft","year":"1979","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory. Addison-Wesley, Reading, Mass., 1979."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. Knuth","year":"1977","unstructured":"D. Knuth, J. Morris, and V. Pratt. Fast pattern matching in strings. SIAM J on Computing, 6:323\u2013350, 1977.","journal-title":"SIAM J on Computing"},{"key":"4_CR13","volume-title":"The Art of Computer Programming: Sorting and Searching, volume 3","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, Reading, Mass., 1973."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D. Morrison","year":"1968","unstructured":"D. Morrison. Patricia-practical algorithm to retrieve information coded in alphanumeric. JACM, 15:514\u2013534, 1968.","journal-title":"JACM"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1215\/S0012-7094-60-02752-6","volume":"27","author":"A.M. Ostrowski","year":"1960","unstructured":"A.M. Ostrowski and H. Schneider. Bounds for the maximal characteristic root of a non-negative irreducible matrix. Duke Math J., 27:547\u2013553, 1960.","journal-title":"Duke Math J."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"R. Pinter. Efficient String Matching with Don't-Care Patterns, volume F12 of NATO ASI Series, pages 11\u201329. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_2"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1137\/0206048","volume":"6","author":"R. Rivest","year":"1977","unstructured":"R. Rivest. On the worst-case behavior of string-searching algorithms. SIAM J on Computing, 6:669\u2013674, 1977.","journal-title":"SIAM J on Computing"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"K. Thompson. Regular expression search algorithm. C.ACM, 11:419\u2013422, 1968.","journal-title":"C.ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:24:04Z","timestamp":1578525844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035751"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0035751","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0035746","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"29 November 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}