Faster algorithms for guided tree edit distance

DOI10.1016/J.IPL.2008.05.014MaRDI QIDQ975465zbMATH OpenOpenAlexFDO

Authors Dekel Tsur

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

zbMATH Keywords

edit distancedesign of algorithmsstring algorithmsordered trees

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Fast algorithms for the unit cost editing distance between trees
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Efficient computation of the tree edit distance

Cites work

• scientific article; zbMATH DE number 1305084 (Why is no real title available?)
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
• More algorithms for all-pairs shortest paths in weighted graphs
• New algorithm for ordered tree-to-tree correction problem
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Tree-to-Tree Correction Problem

Cited in

(1)

• Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge

This page was built for publication: Faster algorithms for guided tree edit distance

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