Comparing similar ordered trees in linear-time
type: Item
instance of: scholarly article
title: Comparing similar ordered trees in linear-time
zbMATH Open document ID: 1156.68042
author: H. Touzet
published in: Journal of Discrete Algorithms
publication date: 2008-05-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 5280791
zbMATH Keywords: ordered trees
zbMATH Keywords: edit distance
zbMATH Keywords: computational biology
MaRDI profile type: Publication
full work available at URL: j.jda.2006.07.002
OpenAlex ID: W2022772986
cites work: The Tree-to-Tree Correction Problem
cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
cites work: Q4252025
cites work: RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
cites work: Analysis of Tree Edit Distance Algorithms
cites work: Alignment of trees -- an alternative to tree edit
cites work: Algorithms and Computation
cites work: Q4432975
cites work: Q4779780
DOI: 10.1016/J.JDA.2006.07.002
description: scientific article; zbMATH DE number 5280791