Abstract
Using this simple, efficient algorithm, a user can submit a pattern tree containing variable length don't cares and obtain those portions of data trees that approximately match that pattern tree. To our knowledge, this is the first algorithm ever presented to solve this problem.
Work supported in part by NSF grants IRI-8901699 and CCR-9103953, by ONR contracts N00014-90-J-1110 and N00014-91-J-1472, by the Natural Sciences and Engineering Research Council of Canada under grant OGP0046373, and by an SBR grant from NJIT
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chodorow, M. S., Klavans, J. L.: Locating syntactic patterns in text corpora. Tech. Rep. IBM T. J. Watson Research Center, New York (1990)
Chodorow, M. S., Byrd, R. J., Heidorn, G. E.: Extracting semantic hierarchies from a large on-line dictionary. Proc. Annual Meetings of the Association for Computational Linguistics (1985) 299–304
Galil, Z., Park, K.: An improved algorithm for approximate string matching. SIAM J. Comput. 19, 6 (1990) 989–999
Kosaraju, S. R.: Efficient tree pattern matching. Proc. 30th Annual Symp. on Foundations of Computer Science (1989) 178–183
Landau, G. M., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10 (1989) 157–169
Markowitz, J., Ahlswede, T., Evans, M.: Semantically significant patterns in dictionary definitions. Proc. Annual Meetings of the Association for Computational Linguistics (1986) 112–119
Myers, E. W., Miller, W.: Approximate matching of regular expressions. Bulletin of Mathematical Biology 51, 1 (1989) 5–37
Pinter, R. Y.: Efficient string matching with don't care patterns. Combinatorial Algorithms on Words, Apostolico, A. and Galil, Z. editors, Springer-Verlag (1985) 11–29
Shasha, D., Zhang, K.: Fast algorithms for the unit cost editing distance between trees. J. Algorithms 11, 4 (1990) 581–621
Tai, K.-C.: The tree-to-tree correction problem. J. ACM 26, 3 (1979) 422–433
Ukkonen, E.: Finding approximate pattern in strings. J. Algorithms 6 (1985) 132–137
Wang, J. T. L., Zhang, K., Jeong, K., Shasha, D.: A tool for tree pattern matching. Proc. 3rd IEEE International Conf. on Tools for AI (1991) 436–444
Wu, S., Manber, U.: Fast text searching with errors. Tech. Rep. TR 91–11, Dept. of Computer Science, University of Arizona (1991)
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Computing 18, 6 (1989) 1245–1262
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, K., Shasha, D., Wang, J.TL. (1992). Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract). In: Apostolico, A., Crochemore, M., Galil, Z., Manber, U. (eds) Combinatorial Pattern Matching. CPM 1992. Lecture Notes in Computer Science, vol 644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56024-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-56024-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56024-1
Online ISBN: 978-3-540-47357-2
eBook Packages: Springer Book Archive