TED
From MaRDI portal
Software:44405
swMATH32694MaRDI QIDQ44405FDOQ44405
Author name not available (Why is that?)
Cited In (9)
- Covering tree with stars
- New and improved algorithms for unordered tree inclusion
- A theory of subtree matching and tree kernels based on the edit distance concept
- Fast similarity search for graphs by edit distance
- The generalized definitions of the two-dimensional largest common substructure problems
- Efficient merged longest common subsequence algorithms for similar sequences
- Title not available (Why is that?)
- Efficient Computation of the Tree Edit Distance
- Algebraic dynamic programming on trees
This page was built for software: TED
