public class StrictLocalAlignmentScoreAlgorithm extends AbstractLocalAlignmentAlgorithm<Double>
AbstractLocalAlignmentAlgorithm.Recurrence
Constructor and Description |
---|
StrictLocalAlignmentScoreAlgorithm(AlignmentSpecification alignmentSpecification) |
Modifier and Type | Method and Description |
---|---|
double |
choice(double... choices)
This implements the strict maximum of the given input doubles.
|
Double |
transformToResult(EnumMap<AbstractLocalAlignmentAlgorithm.Recurrence,double[][]> dp_tables,
double[][] compareMatrix,
double[] deletionMatrix,
double[] insertionMatrix,
double[] skipDeletionMatrix,
double[] skipInsertionMatrix,
Sequence a,
Sequence b)
This method should not be called from outside!
|
calculateAlignment, calculateSkipDeletionCosts, calculateSkipInsertionCosts, getMinMiddleSkips, getResultClass, getSpecification, getWeightThreshold, setMinMiddleSkips, setWeightThreshold
public StrictLocalAlignmentScoreAlgorithm(AlignmentSpecification alignmentSpecification)
public double choice(double... choices)
choice
in class AbstractLocalAlignmentAlgorithm<Double>
choices
- the costs of all choices.public Double transformToResult(EnumMap<AbstractLocalAlignmentAlgorithm.Recurrence,double[][]> dp_tables, double[][] compareMatrix, double[] deletionMatrix, double[] insertionMatrix, double[] skipDeletionMatrix, double[] skipInsertionMatrix, Sequence a, Sequence b)
transformToResult
in class AbstractLocalAlignmentAlgorithm<Double>
dp_tables
- the dynamic programming matrices used during
calculation.compareMatrix
- the local cost for replacing node i from the first
sequence with node j from the second sequence.deletionMatrix
- the local cost for deleting node i from the first
sequence.insertionMatrix
- the local cost for inserting node j from the
second sequence into the first sequence.skipDeletionMatrix
- the local cost for skipping node i in the
first sequence.skipInsertionMatrix
- the local cost for skipping node j in the
second sequence.a
- the first sequence.b
- th second sequence.Copyright (C) 2013, 2014 Benjamin Paaßen, Charlie Krüger, Georg Zentgraf, 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