A constrained edit distance algorithm between semi-ordered trees

DOI10.1016/j.tcs.2008.11.022zbMath1162.68039OpenAlexW2087289587MaRDI QIDQ1006058

Pascal Ferraro, Aïda Ouangraoua

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.022

zbMATH Keywords

dynamic programmingtheory of computationsemi-ordered treestree editing

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Cites Work

• Local similarity between quotiented ordered trees
• Some MAX SNP-hard results concerning unordered labeled trees
• A constrained edit distance between unordered labeled trees
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The String-to-String Correction Problem
• Unnamed Item
• Unnamed Item

This page was built for publication: A constrained edit distance algorithm between semi-ordered trees