Space efficient algorithms for ordered tree comparison
From MaRDI portal
Recommendations
- Algorithms and Computation
- Comparing similar ordered trees in linear-time
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Algorithms and Computation
- More Efficient Algorithm for Ordered Tree Inclusion
- scientific article; zbMATH DE number 1615276
- Efficient search algorithm on compact S-trees
- Optimal algorithms for comparing trees with labeled leaves
Cites work
- scientific article; zbMATH DE number 1305084 (Why is no real title available?)
- A linear space algorithm for computing maximal common subsequences
- A survey on tree edit distance and related problems
- Alignment of trees -- an alternative to tree edit
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- The Tree-to-Tree Correction Problem
- The tree-to-tree editing problem
This page was built for publication: Space efficient algorithms for ordered tree comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930598)