An improved algorithm for tree edit distance with applications for RNA secondary structure comparison

Authors:
Shihyen Chen;Kaizhong Zhang
Affiliations:
Department of Computer Science, The University of Western Ontario, London, Canada;Department of Computer Science, The University of Western Ontario, London, Canada
Venue:
Journal of Combinatorial Optimization
Year:
2014

Citing 9
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
A data structure for dynamic trees

Journal of Computer and System Sciences
Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
Efficient parallel algorithms for string editing and related problems

SIAM Journal on Computing
The String-to-String Correction Problem

Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
Computing the Edit-Distance between Unrooted Ordered Trees

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A survey on tree edit distance and related problems

Theoretical Computer Science
An optimal decomposition algorithm for tree edit distance

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

An ordered labeled tree is a tree in which the nodes are labeled and the left-to-right order among siblings is relevant. The edit distance between two ordered labeled trees is the minimum cost of transforming one tree into the other through a sequence of edit operations. We present techniques for speeding up the tree edit distance computation which are applicable to a family of algorithms based on closely related recursion strategies. These techniques aim to reduce repetitious steps in the original algorithms by exploring certain structural features in the tree. When these features exist in a large portion of the tree, the speedup due to our techniques would be significant. Viable examples for application include RNA secondary structure comparison and structured text comparison.