Cited in
(14)- A subexponential algorithm for the coloured tree partition problem
- A framework for clustering massive graph streams
- Linear-time algorithms for the subpath kernel
- A theory of subtree matching and tree kernels based on the edit distance concept
- LOGML
- ROADRUNNER
- Xproj
- RainForest
- TED
- RTED
- CloseGraph
- Triadic formal concept analysis and triclustering: searching for optimal patterns
- Mining rooted ordered trees under subtree homeomorphism
- Text matching and categorization: mining implicit semantic knowledge from tree-shape structures
This page was built for software: XRules