Abstract
In this paper we consider matching problems on arbitrary ordered labelled trees and ranked trees, which have important applications in many fields such as molecular biology, term rewriting systems and language processing. Given a text tree T and a pattern tree P, we derive an algorithm to find all occurrences of P in T with bounded distance k, in time O(kǀTǀ + ǀPǀ). The distance refers to the number of subtrees to be inserted or deleted from T to obtain P. This problem is an extension of the tree pattern matching problem where deletions of subtrees occur only in T, and of the approximate string matching problem applied to trees. Extensions of the algorithm to solve other relevant problems, such as ranked trees matching, as well as their parallel versions are then devised.
This work has been partially supported by MURST of Italy
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, M. Ganapathi and S.W.K. Tjiang, Code generation using tree matching and dynamic programming, ACM Trans. on Prog. Lang. Sys. 11 (1989) 491–516.
J. Cai, R. Paige and R. Tarjan, More efficient bottom-up tree pattern matching, Proc. CAAP’90, in: LNCS 431 (1990) 72–86.
M. Dubiner, Z. Galil and E. Magen, Faster tree pattern matching, Proc. 31-st IEEE Symp. on Found. of Comp. Sc., (1990) 145–150.
Z. Galil and R. Giancarlo, Data structures and algorithms for approximate string matching, J. Complexity 4 (1988) 33–72.
R. Grossi, A note on the subtree isomorphism for ordered trees and related problems, Inf. Proc. Let. (to appear).
D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comp. 13 (1984) 338–355.
C.M. Hoffmann and M.J. O’Donnel, Pattern matching in trees, J. ACM 29 (1982) 68–95.
P. Kilpelänen and H. Mannila, The tree inclusion problem, Proc. CAAP’91, in: LNCS 493, 1 (1991) 202–214.
S.R. Kosaraju, Efficient tree pattern matching, Proc. 30-th IEEE Symp. on found. of Comp. Sc, (1989) 178–183.
G.M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, J. of Algorithms 10 (1989) 157–169.
F. Luccio and L. Pagli, Simple solutions for approximate tree matching problems, Proc. CAAP’91, in: LNCS 493, 1 (1991) 193–201.
F. Luccio and L. Pagli, An efficient algorithm for some tree matching problems, Inf. Proc. Let. (to appear).
E. Mäkinen, On the subtree isomorphism problem for ordered trees, Inf. Proc. Let. 32 (1989) 271–273.
R. Ramesh and I.V. Ramakrishnan, Nonlinear pattern matching, Proc. ICALP’88, in: LNCS 317 (1988) 473–488.
D. Sankoff and J.B. Kruskal, Eds., Time warps, string edits and macro-molecules: the theory and practice of sequence comparison, Addison-Wesley, Reading, MA 1983.
B. Schieber and U. Vishkin, On finding lowest common ancestor: simplification and parallelization, SIAM J. Comp. 17 (1988) 1253–1262.
D. Shasha and K. Zhang, Fast algorithms for the unit cost editing distance between trees, J. of Algorithms 11 (1990) 581–621.
J.M. Steyaert and P. Flajolet, Patterns and pattern-matching in trees: an analysis, Information and Control 58 (1983) 19–58.
L. Stryer, Biochemestry, 3-rd edition, W.H.Freeman and Co., New York, NY 1988.
K.-C. Tai, The tree-to-tree correction problem, J. ACM 26 (1979) 422–433.
K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comp. 18 (1989) 1245–1262.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Grossi, R., Luccio, F., Pagli, L. (1993). Coding Trees as Strings for Approximate Tree Matching. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds) Sequences II. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9323-8_18
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9323-8_18
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9325-2
Online ISBN: 978-1-4613-9323-8
eBook Packages: Springer Book Archive