Local similarity between quotiented ordered trees
type: Item
instance of: scholarly article
title: Local similarity between quotiented ordered trees
zbMATH Open document ID: 1140.05301
author: Aïda Ouangraoua
author: Pascal Ferraro
author: L. Tichit
author: Serge Dulucq
published in: Journal of Discrete Algorithms
publication date: 2008-05-16T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 5276086
zbMATH Keywords: ordered labeled trees
zbMATH Keywords: local edition
zbMATH Keywords: quotiented graph
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: j.jda.2006.03.010
OpenAlex ID: W1994042976
cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
cites work: Error-Correcting Tree Automata for Syntactic Pattern Recognition
cites work: The String-to-String Correction Problem
cites work: The tree-to-tree editing problem
cites work: The Tree-to-Tree Correction Problem
cites work: An edit distance between quotiented trees
cites work: Q3703700
cites work: Linear trees and RNA secondary structure
cites work: RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
cites work: Identifying approximately common substructures in trees based on a restricted edit distance
DOI: 10.1016/J.JDA.2006.03.010
description: scientific article; zbMATH DE number 5276086