Home

Fast parallel algorithms for the unit cost editing distance between trees

Mon, 03/19/2007 - 09:57 — huliganka
Authors: 
Shasha, D.; Zhang, K.
Author: 
Shasha, D
Zhang, K
Year: 
1989
Venue: 
ACM Symposium on Parallel Algorithms and Architectures
URL: 
http://portal.acm.org/citation.cfm?id=72949
DOI: 
http://doi.acm.org/10.1145/72935.72949
Citations: 
20
Citations range: 
10 - 49
AttachmentSize
Shasha1989Fastparallelalgorithmsfor.pdf736.93 KB

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.