{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:52Z","timestamp":1725664012552},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540560241"},{"type":"electronic","value":"9783540473572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56024-6_2","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:53:15Z","timestamp":1330253595000},"page":"15-26","source":"Crossref","is-referenced-by-count":1,"title":["A language approach to string searching evaluation"],"prefix":"10.1007","author":[{"given":"Mireille","family":"R\u00e9gnier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"2_CR1","first-page":"249","volume":"30","author":"G. Barth","year":"1985","unstructured":"G. Barth. An analytical comparison of two string matching algorithms. IPL, 30:249\u2013256, 1985.","journal-title":"IPL"},{"key":"2_CR2","doi-asserted-by":"crossref","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. CACM, 20:762\u2013772, 1977.","journal-title":"CACM"},{"key":"2_CR3","volume-title":"PhD Thesis CS-89-17","author":"R. Baeza-Yates","year":"1989","unstructured":"R. Baeza-Yates. Efficient text searching. PhD Thesis CS-89-17, Univ. Waterloo, Canada, 1989."},{"key":"2_CR4","first-page":"75","volume-title":"Proc. WADS'89","author":"R.A. Baeza-Yates","year":"1989","unstructured":"R.A. Baeza-Yates. String Searching Algorithms Revisited. In WADS'89, volume 382 of Lecture Notes in Computer Science, pages 75\u201396. Springer-Verlag, 1989. Proc. WADS'89, Ottawa."},{"key":"2_CR5","first-page":"328","volume-title":"SODA '90","author":"R. Baeza-Yates","year":"1990","unstructured":"R. Baeza-Yates, G. Gonnet, and M. R\u00e9gnier. Analysis of Boyer-Moore-type string searching algorithms. In SODA '90, pages 328\u2013343. SIAM, 1990. Proc. Siam-ACM Symp. on Discrete Algorithms, San Francisco, USA."},{"key":"2_CR6","first-page":"332","volume-title":"SWAT'90, volume 447 of Lecture Notes in Computer Science","author":"R. Baeza-Yates","year":"1990","unstructured":"R. Baeza-Yates and M. R\u00e9gnier. Fast algorithms for two dimensional and multiple pattern matching. In SWAT'90, volume 447 of Lecture Notes in Computer Science, pages 332\u2013347. Springer-Verlag, 1990. Proc. Swedish Workshop on Algorithm Theory, Bergen, Norway."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"R. Baeza-Yates and M. R\u00e9gnier. Average running time of Boyer-Moore-Horspool algorithm. Theoretical Computer Science, pages 19\u201331, 1992. special issue.","DOI":"10.1016\/0304-3975(92)90133-Z"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"L. Colussi, Z. Galil, and R. Giancarlo. On the exact Complexity of string matching. In FOCS'90, pages 135\u2013143. IEEE, 1990. Proc. 31-st Annual IEEE Symposium on the Foundations of Computer Science.","DOI":"10.1109\/FSCS.1990.89532"},{"key":"2_CR9","unstructured":"Samuel Eilenberg. Automata, Languages, and Machines, Volume A. Academic Press, 1974."},{"key":"2_CR10","unstructured":"Ch. Hancart. Algorithme de Morris et Pratt et ses raffinements: une analyse en moyenne. Research report 91.56, Universit\u00e9 de Paris VII, October, 1991."},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R. N. Horspool","year":"1980","unstructured":"R. N. Horspool. Practical fast searching in strings. Software-Practice and Experience, 10:501\u2013506, 1980.","journal-title":"Software-Practice and Experience"},{"key":"2_CR12","volume-title":"Introduction to Automata Theory","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J.D. Ullman. Introduction to Automata Theory. Addison Wesley, Reading, Mass, 1979."},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"D.E. 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":"2_CR14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. Karp","year":"1987","unstructured":"R. Karp and M. Rabin. Efficient randomized pattern-matching algorithms. IBM J. Res. Development, 31:249\u2013260, 1987.","journal-title":"IBM J. Res. Development"},{"key":"2_CR15","volume-title":"Combinatorics on Words","author":"Lothaire","year":"1983","unstructured":"Lothaire. Combinatorics on Words. Addison-Wesley, Reading, Mass., 1983."},{"key":"2_CR16","first-page":"431","volume-title":"MFCS'89, volume 379 of Lecture Notes in Computer Science","author":"M. R\u00e9gnier","year":"1989","unstructured":"M. R\u00e9gnier. Knuth-Morris-Pratt algorithm: an analysis. In MFCS'89, volume 379 of Lecture Notes in Computer Science, pages 431\u2013444. Springer-Verlag, 1989. Proc. Mathematical Foundations for Computer Science 89, Porubka, Poland."},{"key":"2_CR17","unstructured":"M. R\u00e9gnier. Performance of String Searching Algorithms under Various Probabilistic Models, 1991. submitted. also as INRIA Research Report 1565."},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1137\/0217041","volume":"17","author":"R. Schaback","year":"1988","unstructured":"R. Schaback. On the Expected Sublinearity of the Boyer-Moore Algorithm. SIAM J. on Computing, 17:548\u2013558, 1988.","journal-title":"SIAM J. on Computing"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"K. Thompson. Regular expression search algorithm. CACM, 11:419\u2013422, 1968.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56024-6_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:41Z","timestamp":1605646961000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56024-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540560241","9783540473572"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-56024-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}