An efficient algorithm for some tree matching problems

Galil, 1988, Data structures and algorithms for approximate string matching, J. Complexity, 4, 33, 10.1016/0885-064X(88)90008-8 Harel, 1984, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13, 338, 10.1137/0213024 Hoffmann, 1982, Pattern matching in trees, J. ACM, 29, 68, 10.1145/322290.322295 Knuth, 1968, Vol. 1 Kosaraju, 1990, Efficient tree pattern matching, Proc. 30th IEEE Symp. on Foundations of Computer Science, 178 Landau, 1986, Introducing efficient parallelism into approximate string matching and a new serial algorithm, Proc. 18th ACM Symp. on Theory of Computing, 220 Mäkinen, 1989, On the subtree isomorphism problem for ordered trees, Inform. Process. Lett., 32, 271, 10.1016/0020-0190(89)90056-2 Zaks, 1980, Lexicographic generation of ordered trees, Theoret. Comput. Sci., 10, 63, 10.1016/0304-3975(80)90073-0 Zhang, 1989, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput., 18, 1245, 10.1137/0218082