{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:40:21Z","timestamp":1775281221514,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540612582","type":"print"},{"value":"9783540683902","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61258-0_23","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:21:05Z","timestamp":1330291265000},"page":"320-334","source":"Crossref","is-referenced-by-count":14,"title":["Alphabet independent and dictionary scaled matching"],"prefix":"10.1007","author":[{"given":"Amihood","family":"Amir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gruia","family":"Calinescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"A. Amir and G. Benson. Efficient two dimensional compressed matching. Proc. of Data Compression Conference, Snow Bird, Utah, pages 279\u2013288, Mar 1992.","DOI":"10.1109\/DCC.1992.227453"},{"key":"23_CR2","unstructured":"A. Amir and G. Benson. Two-dimensional periodicity and its application. Proc. of 3rd Symposium on Discrete Algorithms, Orlando, FL, pages 440\u2013452, Jan 1992."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. The truth, the whole truth, and nothing but the truth: Alphabet independent two dimensional witness table construction. Technical Report GIT-CC-92\/52, Georgia Institute of Technology, August 1992.","DOI":"10.1145\/129712.129719"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. Optimal parallel two dimensional pattern matching. Proc. of the 5th ACM Symp. on Parallel Algorithms and Architectures, pages 79\u201385, 1993.","DOI":"10.1145\/165231.165242"},{"issue":"2","key":"23_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/S0097539792226321","volume":"23","author":"A. Amir","year":"1994","unstructured":"A. Amir, G. Benson, and M. Farach. An alphabet independent approach to two dimensional pattern matching. SIAM J. Comp., 23(2):313\u2013323, 1994.","journal-title":"SIAM J. Comp."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"A. Amir, G. Benson, and M. Farach. Optimal two-dimensional compressed matching. Proc. ICALP 94, pages 215\u2013226, 1994.","DOI":"10.1007\/3-540-58201-0_70"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(92)90206-B","volume":"44","author":"A. Amir","year":"1992","unstructured":"A. Amir and M. Farach. Two dimensional dictionary matching. Information Processing Letters, 44:233\u2013239, 1992.","journal-title":"Information Processing Letters"},{"key":"23_CR8","unstructured":"A. Amir, M. Farach, R.M. Idury, J.A. La Poutr\u00e9, and A.A Sch\u00e4ffer. Improved dynamic dictionary matching. Proc. 4th ACM-SIAM SODA, pages 392\u2013401, 1993."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"A. Amir, M. Farach, and Y. Matias. Efficient randomized dictionary matching algorithms. Proc. 3rd. Combinatorial Pattern Matching Conference, pages 259\u2013272, 1992. Tucson, Arizona.","DOI":"10.1007\/3-540-56024-6_21"},{"issue":"1","key":"23_CR10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0196-6774(92)90003-U","volume":"13","author":"A. Amir","year":"1992","unstructured":"A. Amir, G.M. Landau, and U. Vishkin. Efficient pattern matching with scaling. Journal of Algorithms, 13(1):2\u201332, 1992.","journal-title":"Journal of Algorithms"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"R. Cole, M. Crochemore, Z. Galil, L. Gasieniec, R. Harihan, S. Muthukrishnan, K. Park, and W. Rytter. Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions. Proc. 34th IEEE FOCS, pages 248\u2013258, 1993.","DOI":"10.1109\/SFCS.1993.366862"},{"key":"23_CR12","unstructured":"Larry S. Davis. Personal Communication, 1989."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"H. N. Gabow, J. L. Bentley, and R. E. Tarjan. Scaling and related techniques for geometry problems. Proc. 16th ACM Symposium on Theory of Computing, 67(135\u2013143), 1984.","DOI":"10.1145\/800057.808675"},{"key":"23_CR14","unstructured":"R. Giancarlo. The suffix of a square matrix, with applications. Proc. 4th SODA, pages 402\u2013410, 1993."},{"key":"23_CR15","first-page":"338","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestor. Computer and System Science, 13:338\u2013355, 1984.","journal-title":"Computer and System Science"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"R.M. Idury and A.A Sch\u00e4ffer. Multiple matching of rectangular patterns. Proc. 25th ACM STOC, pages 81\u201389, 1993.","DOI":"10.1145\/167088.167116"},{"key":"23_CR17","doi-asserted-by":"publisher","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:262\u2013272, 1976.","journal-title":"Journal of the ACM"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"K. Park and Z. Galil. Truly alphabet-independent two-dimensional pattern matching. Proc. 33rd IEEE FOCS, pages 247\u2013256, 1992.","DOI":"10.1109\/SFCS.1992.267767"},{"key":"23_CR19","unstructured":"A. Pentland. Invited talk. NSF Institutional Infrastructure Workshop, 1992."},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithm. Proc. 14 IEEE Symposium on Switching and Automata Theory, pages 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61258-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:14:55Z","timestamp":1742598895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61258-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612582","9783540683902"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61258-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}