TED
From MaRDI portal
Software:44405
No author found.
Related Items (9)
Algebraic dynamic programming on trees ⋮ 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 ⋮ Unnamed Item ⋮ A theory of subtree matching and tree kernels based on the edit distance concept ⋮ New and improved algorithms for unordered tree inclusion ⋮ Efficient Computation of the Tree Edit Distance ⋮ Covering tree with stars
This page was built for software: TED