New algorithm for ordered tree-to-tree correction problem

DOI10.1006/JAGM.2001.1170MaRDI QIDQ2746431zbMATH OpenOpenAlexFDO

Authors Weimin Chen

Publication date 4 March 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2001.1170

zbMATH Keywords

ordered tree-to-tree correction problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• scientific article; zbMATH DE number 1305084
• Combinatorial Pattern Matching
• Alignment of trees -- an alternative to tree edit
• An optimal decomposition algorithm for tree edit distance

Cited in

(14)

• A survey on tree matching and XML retrieval
• Algorithms for finding a most similar subforest
• Approximating tree edit distance through string edit distance
• Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
• Faster algorithms for guided tree edit distance
• Ordered tree alignment with genetic programming
• A survey on tree edit distance and related problems
• Algorithms and Computation
• A relation between edit distance for ordered trees and edit distance for Euler strings
• Fast algorithms for computing tree LCS
• Fast Algorithms for Computing Tree LCS
• A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
• Further comments on the subtree isomorphism for ordered trees
• Algebraic dynamic programming on trees

This page was built for publication: New algorithm for ordered tree-to-tree correction problem

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