A new constrained edit distance between quotiented ordered trees

DOI10.1016/j.jda.2008.05.001zbMath1160.90683OpenAlexW2010677715MaRDI QIDQ1013074

Pascal Ferraro, Aïda Ouangraoua

Publication date: 16 April 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.05.001

zbMATH Keywords

dynamic programmingordered labeled treesedit distancequotiented graph

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cites Work

• Local similarity between quotiented ordered trees
• The tree-to-tree editing problem
• An edit distance between quotiented trees
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• The Tree-to-Tree Correction Problem
• The String-to-String Correction Problem
• Efficient drawing of RNA secondary structure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item