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 | Method and Description |
---|---|
abstract R |
SparseAbstractADPAlgorithm.transformToResult(EnumMap<N,SparseAbstractADPAlgorithm.SparseMatrix> dpTables,
EnumMap<OperationType,SparseAbstractADPAlgorithm.SparseMatrix> repMatrices,
EnumMap<OperationType,double[]> delVectors,
EnumMap<OperationType,double[]> insVectors,
List<X> a,
List<Y> b)
This method should not be called from outside!
The subclass uses this method to transform the alignment matrix and the input sequences to
the actual alignment result.
|
abstract R |
SparseAbstractADPAlgorithm.transformToResult(EnumMap<N,SparseAbstractADPAlgorithm.SparseMatrix> dpTables,
EnumMap<OperationType,SparseAbstractADPAlgorithm.SparseMatrix> repMatrices,
EnumMap<OperationType,double[]> delVectors,
EnumMap<OperationType,double[]> insVectors,
List<X> a,
List<Y> b)
This method should not be called from outside!
The subclass uses this method to transform the alignment matrix and the input sequences to
the actual alignment result.
|
Double |
SparseStrictADPScoreAlgorithm.transformToResult(EnumMap<N,SparseAbstractADPAlgorithm.SparseMatrix> dpTables,
EnumMap<OperationType,SparseAbstractADPAlgorithm.SparseMatrix> repMatrices,
EnumMap<OperationType,double[]> delVectors,
EnumMap<OperationType,double[]> insVectors,
List<X> a,
List<Y> b) |
Double |
SparseStrictADPScoreAlgorithm.transformToResult(EnumMap<N,SparseAbstractADPAlgorithm.SparseMatrix> dpTables,
EnumMap<OperationType,SparseAbstractADPAlgorithm.SparseMatrix> repMatrices,
EnumMap<OperationType,double[]> delVectors,
EnumMap<OperationType,double[]> insVectors,
List<X> a,
List<Y> b) |
Alignment<X,Y> |
SparseStrictADPFullAlgorithm.transformToResult(EnumMap<N,SparseAbstractADPAlgorithm.SparseMatrix> dpTables,
EnumMap<OperationType,SparseAbstractADPAlgorithm.SparseMatrix> repMatrices,
EnumMap<OperationType,double[]> delVectors,
EnumMap<OperationType,double[]> insVectors,
List<X> a,
List<Y> b) |
Alignment<X,Y> |
SparseStrictADPFullAlgorithm.transformToResult(EnumMap<N,SparseAbstractADPAlgorithm.SparseMatrix> dpTables,
EnumMap<OperationType,SparseAbstractADPAlgorithm.SparseMatrix> repMatrices,
EnumMap<OperationType,double[]> delVectors,
EnumMap<OperationType,double[]> insVectors,
List<X> a,
List<Y> b) |
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/