Local similarity between quotiented ordered trees

DOI10.1016/j.jda.2006.03.010zbMath1140.05301OpenAlexW1994042976MaRDI QIDQ924539

Laurent Tichit, Aïda Ouangraoua, Pascal Ferraro, Dulucq, Serge

Publication date: 16 May 2008

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

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

zbMATH Keywords

dynamic programmingordered labeled treeslocal editionquotiented graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Nonnumerical algorithms (68W05) Dynamic programming (90C39) Protein sequences, DNA sequences (92D20)

Related Items (3)

A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes ⋮ A constrained edit distance algorithm between semi-ordered trees ⋮ A new constrained edit distance between quotiented ordered trees

Cites Work

• Unnamed Item
• The tree-to-tree editing problem
• Linear trees and RNA secondary structure
• An edit distance between quotiented trees
• RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
• Identifying approximately common substructures in trees based on a restricted edit distance
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Error-Correcting Tree Automata for Syntactic Pattern Recognition
• The Tree-to-Tree Correction Problem
• The String-to-String Correction Problem

This page was built for publication: Local similarity between quotiented ordered trees