Package | Description |
---|---|
de.citec.tcs.alignment.adp |
This package contains a more general approach to construct
AlignmentAlgorithms by relying on the theoretical concept of Algebraic
Dynamic Programming (ADP) as developed by Giegerich et al.
|
Modifier and Type | Class and Description |
---|---|
class |
SoftADPFullAlgorithm<X,Y,N extends Enum<N>>
This algorithm returns a SoftADPPathModel based on the given grammar
and algebra/Comparator.
|
class |
SoftADPScoreAlgorithm<X,Y,N extends Enum<N>>
This algorithm calculates the soft alignment score for the given
input grammar and algebra/Comparator.
|
class |
StrictADPCooptimalAlgorithm<X,Y,N extends Enum<N>>
This algorithm calculates all co-optimal paths in form of a CooptimalModel
|
class |
StrictADPFullAlgorithm<X,Y,N extends Enum<N>>
This algorithm calculates an optimal AlignmentPath using the given ADP grammar and
algebra/Comparator.
|
class |
StrictADPScoreAlgorithm<X,Y,N extends Enum<N>>
This algorithm calculates the strict alignment score for the given input grammar and
algebra/Comparator.
|
Copyright (C) 2016 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/