A metric normalization of tree edit distance
From MaRDI portal
Publication:352044
DOI10.1007/s11704-011-9336-2zbMath1267.68227OpenAlexW159237226MaRDI QIDQ352044
Publication date: 4 July 2013
Published in: Frontiers of Computer Science in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11704-011-9336-2
metricnormalizationtriangle inequalityapproximating and eliminating search algorithm (AESA)tree edit distance
Pattern recognition, speech recognition (68T10) Knowledge representation (68T30) Algorithms on strings (68W32)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey on tree edit distance and related problems
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Pattern Matching in Trees
- On the Theory and Computation of Evolutionary Distances
- The Tree-to-Tree Correction Problem
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares
- Nonlinear pattern matching in trees
- The String-to-String Correction Problem
- Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
- Ordered and Unordered Tree Inclusion
- A note on the Nagendraprasad-Wang-Gupta thinning algorithm
This page was built for publication: A metric normalization of tree edit distance