Analysis of tree edit distance algorithms

DOI10.1007/3-540-44888-8_7MaRDI QIDQ3550829zbMATH OpenOpenAlexFDO

Authors Serge Dulucq, H. Touzet

Publication date 6 April 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44888-8_7

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms (68W40) Protein sequences, DNA sequences (92D20)

Recommendations

• Decomposition algorithms for the tree edit distance problem
• Fast algorithms for the unit cost editing distance between trees
• An optimal decomposition algorithm for tree edit distance
• Efficient computation of the tree edit distance
• An Optimal Decomposition Algorithm for Tree Edit Distance

Cited in

(11)

• Decomposition algorithms for the tree edit distance problem
• scientific article; zbMATH DE number 2089060 (Why is no real title available?)
• A survey on tree matching and XML retrieval
• scientific article; zbMATH DE number 2043356 (Why is no real title available?)
• Efficient computation of the tree edit distance
• Theoretical Computer Science
• Fast algorithms for the unit cost editing distance between trees
• Faster algorithms for bounded tree edit distance
• A theory of subtree matching and tree kernels based on the edit distance concept
• Comparing similar ordered trees in linear-time
• Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of an RNA secondary structure alignment algorithm

This page was built for publication: Analysis of tree edit distance algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3550829)