Download JAR files tagged by shasha with all dependencies
tree-edit-distance from group de.unistuttgart.ims (version 0.0.1)
This library is an implementation of Zhang and Shasha's algorithm [Zhang89] for calculating tree edit distance.
Artifact tree-edit-distance
Group de.unistuttgart.ims
Version 0.0.1
Last update 06. April 2016
Organization not specified
URL https://github.com/nilsreiter/tree-edit-distance
License BSD 3-Clause License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
Group de.unistuttgart.ims
Version 0.0.1
Last update 06. April 2016
Organization not specified
URL https://github.com/nilsreiter/tree-edit-distance
License BSD 3-Clause License
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!
zhang-shasha-java from group com.github.tmatek (version 1.01)
A Java implementation of Zhang-Shasha algorithm for ordered tree distance calculation.
Calculates a series of transformations required to transform one tree into another. Every
transformation has an associated cost. The sum of costs of all transformations is minimal - the tree distance.
Group: com.github.tmatek Artifact: zhang-shasha-java
Show all versions Show documentation Show source
Show all versions Show documentation Show source
0 downloads
Artifact zhang-shasha-java
Group com.github.tmatek
Version 1.01
Last update 20. January 2017
Organization not specified
URL https://github.com/tmatek/zhang-shasha-java
License MIT License
Dependencies amount 1
Dependencies junit,
There are maybe transitive dependencies!
Group com.github.tmatek
Version 1.01
Last update 20. January 2017
Organization not specified
URL https://github.com/tmatek/zhang-shasha-java
License MIT License
Dependencies amount 1
Dependencies junit,
There are maybe transitive 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.
0 downloads
Artifact trees
Group de.cit-ec.tcs.alignment
Version 3.1.1
Last update 26. October 2018
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
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 3)