{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:36Z","timestamp":1760202516458},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1007\/bf01185433","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T16:12:30Z","timestamp":1108743150000},"page":"375-408","source":"Crossref","is-referenced-by-count":34,"title":["Pattern matching in a digitized image"],"prefix":"10.1007","volume":"12","author":[{"given":"G. M.","family":"Landau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01185433_CR1","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1137\/0216067","volume":"17","author":"K. Abrahamson","year":"1987","unstructured":"K. Abrahamson. Generalized string matching.SIAM J. Comput., 17:1039\u20131051, 1987.","journal-title":"SIAM J. Comput."},{"issue":"6","key":"BF01185433_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A. V. Aho","year":"1975","unstructured":"A. V. Aho and M. J. Corasick, Efficient string matching,Comm. ACM, 18(6):333\u2013340, 1975.","journal-title":"Comm. ACM"},{"key":"BF01185433_CR3","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:347\u2013365, 1988.","journal-title":"Algorithmica"},{"key":"BF01185433_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(91)90318-V","volume":"81","author":"A. Amir","year":"1991","unstructured":"A. Amir and G. M. Landau, Fast parallel and serial multidimensional approximate array matching,Theoret. Comput. Sci., 81:97\u2013115, 1991.","journal-title":"Theoret. Comput. Sci."},{"key":"BF01185433_CR5","volume-title":"Computer Vision","author":"D. H. Ballard","year":"1982","unstructured":"D. H. Ballard and C. M. Brown.Computer Vision, Prentice-Hall, Englewood Cliffs, NJ, 1982."},{"key":"BF01185433_CR6","unstructured":"S. Ben-Yehuda and R. Y. Pinter. Symbolic layout improvement using string matching based local transformation.Proc. Decennial Caltech Conf. on VL SI, pp. 227\u2013239, 1989."},{"issue":"2","key":"BF01185433_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0222017","volume":"22","author":"O. Berkman","year":"1993","unstructured":"O. Berkman and U. Vishkin. Recursive star-tree parallel data-structure.SIAM J. Comput., 22(2):221\u2013242, 1993.","journal-title":"SIAM J. Comput."},{"key":"BF01185433_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0004-3702(71)90005-1","volume":"2","author":"M. B. Clowes","year":"1971","unstructured":"M. B. Clowes. On seeing things.Artificial Intelligence, 2:79\u2013116, 1971.","journal-title":"Artificial Intelligence"},{"key":"BF01185433_CR9","doi-asserted-by":"crossref","unstructured":"M. Dubiner, Z. Galil and E. Magen. Faster tree pattern matching.Proc. 31th IEEE Symp. on Foundations of Computer Science, pp. 145\u2013150, 1990.","DOI":"10.1109\/FSCS.1990.89533"},{"key":"BF01185433_CR10","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner and L. Guibas. Topologically sweeping an arrangement.Proc. 18th ACM Symp. on Theory of Computing, pp. 389\u2013403, 1986.","DOI":"10.1145\/12130.12171"},{"issue":"4","key":"BF01185433_CR11","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A Itai, and A. Shamir. On the complexity of timetables and multicommodity flow problems.SIAM J. Comp., 5(4):691\u2013703, 1976.","journal-title":"SIAM J. Comp."},{"key":"BF01185433_CR12","doi-asserted-by":"crossref","unstructured":"S. Fortune. Stable maintenance of point set triangulations in two dimensions.Proc. 30th IEEE Symp. on Foundation of Computer Science, pp. 494\u2013499, 1989.","DOI":"10.1109\/SFCS.1989.63524"},{"key":"BF01185433_CR13","series-title":"SIAM-AMS Proceedings, Vol. 7","first-page":"113","volume-title":"Complexity of Computation","author":"M. J. Fischer","year":"1974","unstructured":"M. J. Fischer and M. S. Paterson. String matching and other products. InComplexity of Computation, R. M. Karp (Ed.). SIAM-AMS Proceedings, Vol. 7, pp. 113\u2013125. SIAM, Philadelphia, PA, 1974."},{"key":"BF01185433_CR14","first-page":"295","volume-title":"Machine Intelligence","author":"D. A. Huffman","year":"1971","unstructured":"D. A. Huffman. Impossible objects as nonsense sentences. InMachine Intelligence, B. Meltzer and D. Michie (Eds.), Vol. 6, pp. 295\u2013323. Edinburgh University Press, Edinburgh, 1971."},{"key":"BF01185433_CR15","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"D. Harel and R. E. Tarjan. Fast algorithms for finding nearest common ancestors.SIAM J. Comput., 13:338\u2013355, 1984.","journal-title":"SIAM J. Comput."},{"key":"BF01185433_CR16","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju. Efficient tree pattern matching.Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 178\u2013183, 1989.","DOI":"10.1109\/SFCS.1989.63475"},{"key":"BF01185433_CR17","doi-asserted-by":"crossref","unstructured":"R. M. Karp, R. E. Miller, and A. L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays.Proc. 4th ACM Symp. on Theory of Computing, pp. 125\u2013136, 1972.","DOI":"10.1145\/800152.804905"},{"issue":"11","key":"BF01185433_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/125490.125491","volume":"34","author":"E. S. Lander","year":"1991","unstructured":"E. S. Lander, R. Langridge, and D. M. Saccocio, A report on computing in molecular biology: mapping and interpreting biological information.Comm. ACM, 34(11):33\u201339, 1991.","journal-title":"Comm. ACM"},{"key":"BF01185433_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"G. M. Landau","year":"1988","unstructured":"G. M. Landau and U. Vishkin. Efficient string matching withk differences.J. Comput. System Sci., 37:63\u201378, 1988.","journal-title":"J. Comput. System Sci."},{"key":"BF01185433_CR20","unstructured":"G. M. Landau and U. Vishkin. Pattern matching in a digitized image.Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, pp. 453\u2013462, 1992."},{"key":"BF01185433_CR21","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.J. Assoc. Comput. Mach., 23:262\u2013272, 1976.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01185433_CR22","doi-asserted-by":"crossref","unstructured":"V. Milenkovic. Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic.Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 500\u2013505, 1989.","DOI":"10.1109\/SFCS.1989.63525"},{"key":"BF01185433_CR23","series-title":"NATO ASI Series, Series F: Computer and System Sciences, Vol. 12","first-page":"97","volume-title":"Combinatorial Algorithms on Words","author":"R. Y. Pinter","year":"1985","unstructured":"R. Y. Pinter. Efficient string matching with don't-care patterns. InCombinatorial Algorithms on Words, A. Apostolico and Z. Galil (Eds.). NATO ASI Series, Series F: Computer and System Sciences, Vol. 12, pp. 97\u2013107. Springer-Verlag, New York, 1985."},{"key":"BF01185433_CR24","volume-title":"Maximum-likelihood edge detection in digital signals. TR-492","author":"A. Rosenfeld","year":"1990","unstructured":"A. Rosenfeld and S. Banerjee. Maximum-likelihood edge detection in digital signals. TR-492, Center for Automation Research, University of Maryland, College Park, March 1990."},{"key":"BF01185433_CR25","volume-title":"Digital Picture Processing","author":"A. Rosenfeld","year":"1982","unstructured":"A. Rosenfeld and A. C. Kak.Digital Picture Processing, 2nd edn. Academic Press, New York, 1982.","edition":"2nd edn."},{"key":"BF01185433_CR26","volume-title":"The Design and Analysis of Spatial Data Structures","author":"H. Samet","year":"1990","unstructured":"H. Samet.The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990."},{"key":"BF01185433_CR27","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization.SIAM J. Comput., 17:1253\u20131262, 1988.","journal-title":"SIAM J. Comput."},{"key":"BF01185433_CR28","doi-asserted-by":"crossref","unstructured":"P. Weiner. Linear pattern matching algorithm.Proc. 14th IEEE Symp. on Switching and Automata Theory, pp. 1\u201311, 1973.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185433.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01185433\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01185433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:41:39Z","timestamp":1556728899000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01185433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":28,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["BF01185433"],"URL":"https:\/\/doi.org\/10.1007\/bf01185433","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}