Fast algorithms for the unit cost editing distance between trees

DOI10.1016/0196-6774(90)90011-3MaRDI QIDQ5750416zbMATH OpenOpenAlexFDO

Authors Dennis Shasha, Kaizhong Zhang

Publication date 1990

Published in Journal of Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/0196-6774(90)90011-3

zbMATH Keywords

dynamic programmingparallel algorithmsdistance between trees

Mathematics Subject Classification ID

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)

Recommendations

• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• An Optimal Decomposition Algorithm for Tree Edit Distance
• An optimal decomposition algorithm for tree edit distance
• Constrained tree editing
• Analysis of tree edit distance algorithms

Cited in

(23)

• Theoretical Computer Science
• Algorithms for approximate graph matching
• scientific article; zbMATH DE number 2043356 (Why is no real title available?)
• Analysis of tree edit distance algorithms
• Efficient computation of the tree edit distance
• A relation between edit distance for ordered trees and edit distance for Euler strings
• Approximation and special cases of common subtrees and editing distance
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
• An algebraic view of the relation between largest common subtrees and smallest common supertrees
• A survey on tree edit distance and related problems
• A parallel tree difference algorithm
• Efficient exponential-time algorithms for edit distance between unordered trees
• Faster algorithms for guided tree edit distance
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Scale Space and PDE Methods in Computer Vision
• Edit distance between unrooted trees in cubic time
• Decomposition algorithms for the tree edit distance problem
• On the hardness of computing the edit distance of shallow trees
• New dissimilarity measure for recognizing noisy subsequence trees
• A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
• scientific article; zbMATH DE number 2185644 (Why is no real title available?)
• Numerical similarity and dissimilarity measures between two trees
• Membrane Computing

This page was built for publication: Fast algorithms for the unit cost editing distance between trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5750416)