nyu.edu

Fast parallel algorithms for the unit cost editing distance between trees

Authors: 
Shasha, D.; Zhang, K.
Year: 
1989
Venue: 
ACM Symposium on Parallel Algorithms and Architectures

Ordered labeled trees are trees whose
nodes are labeled and in which the left-to-right
order among siblings is significant. We consider
the distance between two trees to be the minimum
number of edit operations (insert, delete, and
modify) necessary to transform one tree to another.

Syndicate content