Abstract
We present a fast algorithm for optimal alignment between two similar ordered trees with node labels. Let S and T be two such trees with |S| and |T| nodes, respectively. An optimal alignment between S and T which uses at most d blank symbols can be constructed in O(n log n. (maxdeg)4. d2) time, where n = maxf{|S|,|T|} and maxdeg is the maximum degree of a node in S or T. In particular, if the input trees are of bounded degree, the running time is O(n log n. d2).
Cite
CITATION STYLE
Jansson, J., & Lingas, A. (2001). A fast algorithm for optimal alignment between similar ordered trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2089, pp. 232–240). Springer Verlag. https://doi.org/10.1007/3-540-48194-x_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
