Cited in
(9)- Efficient merged longest common subsequence algorithms for similar sequences
- The generalized definitions of the two-dimensional largest common substructure problems
- A theory of subtree matching and tree kernels based on the edit distance concept
- TED
- XRules
- Fast similarity search for graphs by edit distance
- Covering tree with stars
- Rapidly computing the phylogenetic transfer index
- New and improved algorithms for unordered tree inclusion
This page was built for software: RTED
