A theory of subtree matching and tree kernels based on the edit distance concept
From MaRDI portal
Publication:906000
DOI10.1007/s10472-015-9467-5zbMath1347.68114OpenAlexW1730588416MaRDI QIDQ906000
Publication date: 28 January 2016
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-015-9467-5
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tree edit distance and maximum agreement subtree
- A survey on tree edit distance and related problems
- Alignment of trees -- an alternative to tree edit
- XRules: an effective algorithm for structural classification of XML data
- Edit distance-based kernel functions for structural pattern classification
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Analysis of Tree Edit Distance Algorithms
- A stagewise rejective multiple test procedure based on a modified Bonferroni test
- A Tree-to-Tree Distance and Its Application to Cluster Analysis
- The Tree-to-Tree Correction Problem
- The String-to-String Correction Problem
- Theoretical Computer Science
- An Optimal Decomposition Algorithm for Tree Edit Distance
- Bridging the Gap between Graph Edit Distance and Kernel Machines
- Finding similar consensus between trees: An algorithm and a distance hierarchy
This page was built for publication: A theory of subtree matching and tree kernels based on the edit distance concept