Fast algorithms for the unit cost editing distance between trees
From MaRDI portal
Publication:5750416
DOI10.1016/0196-6774(90)90011-3zbMATH Open0718.68060OpenAlexW2035582095MaRDI QIDQ5750416FDOQ5750416
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
Recommendations
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)
Cited In (18)
- A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression.
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- A survey on tree edit distance and related problems
- A relation between edit distance for ordered trees and edit distance for Euler strings
- Title not available (Why is that?)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees
- Decomposition algorithms for the tree edit distance problem
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Scale Space and PDE Methods in Computer Vision
- Algorithms for approximate graph matching
- Numerical similarity and dissimilarity measures between two trees
- Title not available (Why is that?)
- Approximation and special cases of common subtrees and editing distance
- Efficient exponential-time algorithms for edit distance between unordered trees
- New dissimilarity measure for recognizing noisy subsequence trees
- On the hardness of computing the edit distance of shallow trees
- Title not available (Why is that?)
- A parallel tree difference algorithm
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)
