Comparing similar ordered trees in linear-time
From MaRDI portal
(Redirected from Publication:925064)
Recommendations
Cites work
- scientific article; zbMATH DE number 1305084 (Why is no real title available?)
- scientific article; zbMATH DE number 1998340 (Why is no real title available?)
- scientific article; zbMATH DE number 1820633 (Why is no real title available?)
- Algorithms and Computation
- Alignment of trees -- an alternative to tree edit
- Analysis of tree edit distance algorithms
- RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- The Tree-to-Tree Correction Problem
Cited in
(8)- Space efficient algorithms for ordered tree comparison
- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity
- Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
- On the hardness of computing the edit distance of shallow trees
- Computer Vision - ECCV 2004
- Combinatorial Pattern Matching
- Algorithms and Computation
- Algorithms for finding a most similar subforest
This page was built for publication: Comparing similar ordered trees in linear-time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925064)