Faster algorithms for guided tree edit distance
From MaRDI portal
Publication:975465
DOI10.1016/j.ipl.2008.05.014zbMath1191.68213OpenAlexW2008865991MaRDI QIDQ975465
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.014
Cites Work
- Unnamed Item
- New Algorithm for Ordered Tree-to-Tree Correction Problem
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
- More algorithms for all-pairs shortest paths in weighted graphs
- The Tree-to-Tree Correction Problem
- An Optimal Decomposition Algorithm for Tree Edit Distance
This page was built for publication: Faster algorithms for guided tree edit distance
