Fast algorithms for the unit cost editing distance between trees
From MaRDI portal
Publication:5750416
DOI10.1016/0196-6774(90)90011-3zbMath0718.68060OpenAlexW2035582095MaRDI QIDQ5750416
Dennis Shasha, Zhang, Kaizhong
Publication date: 1990
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(90)90011-3
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Data structures (68P05) Distributed algorithms (68W15)
Related Items
A relation between edit distance for ordered trees and edit distance for Euler strings, Algorithms for approximate graph matching, On the hardness of computing the edit distance of shallow trees, Unnamed Item, New dissimilarity measure for recognizing noisy subsequence trees, A parallel tree difference algorithm, A survey on tree edit distance and related problems, An algebraic view of the relation between largest common subtrees and smallest common supertrees, A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression., FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES