Comparing similar ordered trees in linear-time

DOI10.1016/j.jda.2006.07.002zbMath1156.68042OpenAlexW2022772986MaRDI QIDQ925064

Hélène Touzet

Publication date: 29 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.07.002

zbMATH Keywords

computational biologyordered treesedit distance

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Protein sequences, DNA sequences (92D20) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

On the hardness of computing the edit distance of shallow trees ⋮ Algorithms for finding a most similar subforest

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Alignment of trees -- an alternative to tree edit
• RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• Analysis of Tree Edit Distance Algorithms
• The Tree-to-Tree Correction Problem
• Algorithms and Computation

This page was built for publication: Comparing similar ordered trees in linear-time