See: Description
Class | Description |
---|---|
AbstractGreedySetAlignmentAlgorithm<X,Y,R> |
This is an abstract super class providing a greedy solution approach to the optimal set alignment
problem.
|
AbstractStrictSetAlignmentAlgorithm<X,Y,R> |
This is an abstract super class solving the optimal set alignment problem via the Hungarian
algorithm for the assignment problem.
|
GreedySetAlignmentFullAlgorithm<X,Y> |
This is an implementation of the Hungarian algorithm for the optimal set alignment.
|
GreedySetAlignmentScoreAlgorithm<X,Y> |
This is an implementation of the greedy algorithm for the optimal set alignment.
|
StrictSetAlignmentFullAlgorithm<X,Y> |
This is an implementation of the Hungarian algorithm for the optimal set alignment.
|
StrictSetAlignmentScoreAlgorithm<X,Y> |
This is an implementation of the Hungarian algorithm for the optimal set alignment.
|
Copyright (C) 2016-2018 Benjamin Paaßen, AG Theoretical Computer Science, Centre of Excellence Cognitive Interaction Technology (CITEC), University of Bielefeld, licensed under the AGPL v. 3: http://openresearch.cit-ec.de/projects/tcs . This documentation is licensed under the conditions of CC-BY-SA 4.0: https://creativecommons.org/licenses/by-sa/4.0/