New Algorithm for Ordered Tree-to-Tree Correction Problem

DOI10.1006/JAGM.2001.1170zbMath0980.68142OpenAlexW2085533860MaRDI QIDQ2746431

Wei-Min 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)

Related Items (10)

Algebraic dynamic programming on trees ⋮ A relation between edit distance for ordered trees and edit distance for Euler strings ⋮ Approximating tree edit distance through string edit distance ⋮ A survey on tree matching and XML retrieval ⋮ Fast Algorithms for Computing Tree LCS ⋮ Algorithms for finding a most similar subforest ⋮ Faster algorithms for guided tree edit distance ⋮ A survey on tree edit distance and related problems ⋮ Fast algorithms for computing tree LCS ⋮ A Multi-labeled Tree Edit Distance for Comparing "Clonal Trees" of Tumor Progression.

This page was built for publication: New Algorithm for Ordered Tree-to-Tree Correction Problem