Showing papers on "Edit distance published in 1989"
01 Mar 1989
TL;DR: A simple dynamic programming algorithm based on a postorder traversal whose complexity improves upon the best previously published algorithm due to Tai and parallel algorithms based on the application of suffix trees to the comparison problem to find the distance between trees.
Abstract: We present three algorithms to find the distance. The first algorithm is a simple dynamic programming algorithm based on a postorder traversal whose complexity improves upon the best previously published algorithm due to Tai (T79 in JACM). The second and third algorithms are parallel algorithms based on the application of suffix trees to the comparison problem. The cost of executing these algorithms is a monotonic increasing function of the distance between the two trees. Results Let trees T I and T2 have numbers of levels L i and L 2 respectively. Let k be the actual distance between T 1 and T2. Let N be rain (IT11, IT2 ]). The asymptotic running times (assuming a concurrentread concurrent-write parallel random access machine) are:
15 citations