TED
From MaRDI portal
Cited in
(16)- Efficient merged longest common subsequence algorithms for similar sequences
- New and improved algorithms for unordered tree inclusion
- Fast similarity search for graphs by edit distance
- The generalized definitions of the two-dimensional largest common substructure problems
- Covering tree with stars
- Algebraic dynamic programming on trees
- RNAforester
- BitShred
- DroidMat
- DREBIN
- ADAM
- Edit distance between unrooted trees in cubic time
- Efficient computation of the tree edit distance
- XRules
- RTED
- A theory of subtree matching and tree kernels based on the edit distance concept
This page was built for software: TED
