{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:06Z","timestamp":1759638126551},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633075"},{"type":"electronic","value":"9783540694229"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63307-3_56","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T19:22:48Z","timestamp":1270495368000},"page":"160-173","source":"Crossref","is-referenced-by-count":9,"title":["Pattern matching in hypertext"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noa","family":"Lewenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,30]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"K. Abrahamson. Generalized String Matching. SIAM J. Computing 16 (6), 1039\u20131051, 1987.","journal-title":"SIAM J. Computing"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"T. Akutsu. A Linear Time Pattern Matching Algorithm Between a String and a Tree. Proceedings of the 4th Symposium on Combinatorial Pattern Matching, 1\u201310, Padova, Italy, 1993.","DOI":"10.1007\/BFb0029792"},{"issue":"2","key":"14_CR3","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/S0022-0000(05)80047-9","volume":"49","author":"A. Amir","year":"1994","unstructured":"A. Amir, M. Farach, R. Giancarlo, Z. Galil, and K. Park. Dynamic dictionary matching. Journal of Computer and System Sciences, 49(2):208\u2013222, 1994.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"14_CR4","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1006\/inco.1995.1090","volume":"119","author":"A. Amir","year":"1995","unstructured":"A. Amir, M. Farach, R.M. Idury, J.A. La Poutr\u00e9, and A.A. Schiffer. Improved dynamic dictionary matching. Information and Computation, 119(2):258\u2013282, 1995.","journal-title":"Information and Computation"},{"key":"14_CR5","unstructured":"A. Aviad. Hyper-Talmud: a hypertext system for the Babylonian Talmud and its commentaries. Dept. of Math and Computer Science, Bar-Ilan University, 1993."},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. ACM, 20:762\u2013772, 1977.","journal-title":"Comm. ACM"},{"key":"14_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"T.H. Cormen, C.E. Leiserson and R.L. Rivest. Introduction to Algorithms The MIT Press, Cambridge, Massachusetts, 1990."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"P. Ferragina and R. Grossi. Optimal on-line search and sublinear time update in string matching. Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pages 531\u2013540, 1995.","DOI":"10.1109\/SFCS.1995.492590"},{"key":"14_CR9","unstructured":"A. S. Fraenkel and S. T. Klein. Information Retrieval from Annotated Texts. TR95-25, Dept. of Applied Math and Computer Science, The Weizmann Institute of Science, 1995."},{"key":"14_CR10","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 J. Computing, 6:323\u2013350, 1977.","journal-title":"SIAM J. Computing"},{"key":"14_CR11","unstructured":"D.K. Kim and K. Park. String matching in hypertext. 6th Symposium on Combinatorial Pattern Matching, Helsinki, Finland, 1995."},{"key":"14_CR12","unstructured":"S. Rao Kosaraju. Efficient String Matching. Manuscript, 1987."},{"issue":"2","key":"14_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G. M. Landau","year":"1989","unstructured":"G. M. Landau and U. Vishkin. Fast parallel and serial approximate string matching. Journal of Algorithms 10 (2), 157\u2013169, 1989.","journal-title":"Journal of Algorithms"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"U. Manber and S. Wu. Approximate string matching with arbitrary costs for text and hypertext. IAPR Workshop on structural and syntactic pattern recognition, Bern, Switzerland, 1992.","DOI":"10.1142\/9789812797919_0002"},{"key":"14_CR15","volume-title":"Hypertext and Hypermedia","author":"J. Nielsen","year":"1993","unstructured":"J. Nielsen. Hypertext and Hypermedia. Academic Press Professional, Boston, 1993."},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"S. C. Sahinalp and U. Vishkin. Efficient approximate and dynamic matching of patterns using a labeling paradigm. Proc, of 37th Annual Symposium on Foundations of Computer Science, 320\u2013328, Burlington, Vermont, 1996.","DOI":"10.1109\/SFCS.1996.548491"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63307-3_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T00:13:57Z","timestamp":1559002437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63307-3_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633075","9783540694229"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63307-3_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}