Download all versions of trees JAR files with all dependencies
trees from group de.cit-ec.tcs.alignment (version 3.1.1)
This module provides two packages, 'trees' and 'forests', which provide algorithms to
compute edit distances on trees and forests (that is, unordered or ordered lists of trees)
respectively. The edit distance is computed according to the tree edit distance algorithm
of Zhang and Shasha (1989). The basic tree data structure is defined by the Tree interface
in the trees module. Please refer to the javadoc for more detailed information.
Artifact trees
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
Tags: provide data javadoc algorithm according distances distance please more tree basic refer detailed computed zhang compute algorithms unordered lists forests information structure module defined packages edit respectively provides interface that shasha which ordered trees 1989 this
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 2
Dependencies algorithms, sets,
There are maybe transitive dependencies!
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
Tags: provide data javadoc algorithm according distances distance please more tree basic refer detailed computed zhang compute algorithms unordered lists forests information structure module defined packages edit respectively provides interface that shasha which ordered trees 1989 this
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 2
Dependencies algorithms, sets,
There are maybe transitive dependencies!
trees from group de.cit-ec.tcs.alignment (version 3.1.0)
This module provides two packages, 'trees' and 'forests', which provide algorithms to
compute edit distances on trees and forests (that is, unordered or ordered lists of trees)
respectively. The edit distance is computed according to the tree edit distance algorithm
of Zhang and Shasha (1989). The basic tree data structure is defined by the Tree interface
in the trees module. Please refer to the javadoc for more detailed information.
Artifact trees
Group de.cit-ec.tcs.alignment
Version 3.1.0
Last update 22. May 2018
Tags: provide data javadoc algorithm according distances distance please more tree basic refer detailed computed zhang compute algorithms unordered lists forests information structure module defined packages edit respectively provides interface that shasha which ordered trees 1989 this
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 2
Dependencies algorithms, sets,
There are maybe transitive dependencies!
Group de.cit-ec.tcs.alignment
Version 3.1.0
Last update 22. May 2018
Tags: provide data javadoc algorithm according distances distance please more tree basic refer detailed computed zhang compute algorithms unordered lists forests information structure module defined packages edit respectively provides interface that shasha which ordered trees 1989 this
Organization not specified
URL http://openresearch.cit-ec.de/projects/tcs
License The GNU Affero General Public License, Version 3
Dependencies amount 2
Dependencies algorithms, sets,
There are maybe transitive dependencies!
Page 1 from 1 (items total 2)