{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:46Z","timestamp":1759639066536,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_179","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:39:24Z","timestamp":1330209564000},"page":"739-750","source":"Crossref","is-referenced-by-count":12,"title":["String matching with preprocessing of text and pattern"],"prefix":"10.1007","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"59_CR1","volume-title":"The Handbook of Theoretical Computer Science","author":"A. V. Aho","year":"1990","unstructured":"A. V. Aho, Algorithms for finding patterns in strings, in The Handbook of Theoretical Computer Science, edited by J. van Leeuwen, Elsevier, Amsterdam, 1990."},{"key":"59_CR2","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"A. Apostolico and Z. Galil, Combinatorial algorithms on words, Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2"},{"key":"59_CR4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01762122","volume":"3","author":"A. Apostolico","year":"1988","unstructured":"A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber and U. Vishkin, Parallel construction of a suffix tree with applications, Algorithmica 3, 1988, pp. 347\u2013365.","journal-title":"Algorithmica"},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"Chen and Seifres, Efficient and elegant subword-tree construction, in combinatorial algorithms on words, Springer-Verlag, 1985, pp. 97\u2013110.","DOI":"10.1007\/978-3-642-82456-2_7"},{"key":"59_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1515\/crll.1869.70.185","volume":"70","author":"C. Jordan","year":"1869","unstructured":"C. Jordan, Sur le assemblages des lignes, J. Reine und Ang. Math. 70, 1869, pp. 185\u2013190.","journal-title":"J. Reine und Ang. Math."},{"key":"59_CR7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R. M. Karp","year":"1987","unstructured":"R. M. Karp and M. O. Rabin Efficient randomized pattern-matching algorithms, IBM Journal of R&D, 31, 1987, 249\u2013260.","journal-title":"IBM Journal of R&D"},{"key":"59_CR8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"D. E. Knuth, J. H. Morris and V. R. Pratt, Fast pattern matching in strings, Siam journal on Computing 6, 1977, pp. 323\u2013349.","journal-title":"Siam journal on Computing"},{"key":"59_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A. Lempel","year":"1976","unstructured":"A. Lempel and J. Ziv, On the complexity of finite sequences, IEEE Transactions on Information Theory 22, 1976, pp. 75\u201381.","journal-title":"IEEE Transactions on Information Theory"},{"key":"59_CR10","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight, A space economical suffix tree construction algorithm, Journal of the ACM 23, 1976, 262\u2013272.","journal-title":"Journal of the ACM"},{"key":"59_CR11","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, Journal of the ACM 30, 1983, pp 852\u2013865.","journal-title":"Journal of the ACM"},{"key":"59_CR12","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1980","unstructured":"M. Rodeh, V. R. Pratt and S. Even, Linear algorithms for compression via string matching, Journal of the ACM 28, 1980, pp. 16\u201324.","journal-title":"Journal of the ACM"},{"key":"59_CR13","volume-title":"Data compression: methods and theory","author":"J. A. Storer","year":"1988","unstructured":"J. A. Storer, Data compression: methods and theory, Computer Science Press, Rockville, 1988."},{"key":"59_CR14","doi-asserted-by":"crossref","unstructured":"P. Weiner, Linear pattern matching algorithms Proc. 14th annual Symp. on Switching and Automata Theory, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"A. C. Yao Some complexity question related to distributive computing Proc. 11th ACM Symposioum on Theory of Computing, 1979, pp. 209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"59_CR16","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory 23, 1977, pp. 337\u2013343.","journal-title":"IEEE Transactions on Information Theory"},{"key":"59_CR17","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J. Ziv","year":"1978","unstructured":"J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory 24, 1978, pp. 530\u2013536.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_179.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:15:59Z","timestamp":1742591759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_179","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}