Comparing similar ordered trees in linear-time
From MaRDI portal
Publication:925064
DOI10.1016/J.JDA.2006.07.002zbMATH Open1156.68042OpenAlexW2022772986MaRDI QIDQ925064FDOQ925064
Authors: H. 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
Recommendations
Protein sequences, DNA sequences (92D20) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)
Cites Work
- The Tree-to-Tree Correction Problem
- Title not available (Why is that?)
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Alignment of trees -- an alternative to tree edit
- Analysis of tree edit distance algorithms
- Title not available (Why is that?)
- Algorithms and Computation
- Title not available (Why is that?)
- RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm.
Cited In (8)
- Algorithms for finding a most similar subforest
- Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
- Algorithms and Computation
- Computer Vision - ECCV 2004
- Combinatorial Pattern Matching
- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity
- Space efficient algorithms for ordered tree comparison
- On the hardness of computing the edit distance of shallow trees
This page was built for publication: Comparing similar ordered trees in linear-time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925064)
