Analysis of tree edit distance algorithms
From MaRDI portal
Recommendations
Cited in
(11)- Decomposition algorithms for the tree edit distance problem
- Using edit distance algorithms to compare alternative approaches to ITS authoring
- A survey on tree matching and XML retrieval
- Tree edit distance from information theory
- 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)