Tree edit distance with gaps

DOI10.1016/S0020-0190(02)00369-1zbMath1011.68851OpenAlexW2080144938MaRDI QIDQ1853686

Hélène Touzet

Publication date: 22 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00369-1

zbMATH Keywords

algorithmscomputational complexitycomputational biologytree edit distance

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

Forest alignment with affine gaps and anchors, applied in RNA structure comparison ⋮ Modeling dynamic programming problems over sequences and trees with inverse coupled rewrite systems ⋮ Forest Alignment with Affine Gaps and Anchors ⋮ Decomposition algorithms for the tree edit distance problem

Cites Work

• Unnamed Item
• Unnamed Item
• On a cyclic string-to-string correction problem
• Speeding up dynamic programming with applications to molecular biology
• On the editing distance between unordered labeled trees
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems

This page was built for publication: Tree edit distance with gaps