Changeset 1583 for branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/SequenceForTaskDetectionRuleAlignment.java
- Timestamp:
- 06/26/14 23:34:58 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/temporalrelation/SequenceForTaskDetectionRuleAlignment.java
r1580 r1583 160 160 UPGMAMatrix sequenceDistances = new UPGMAMatrix(numberseqs.size()); 161 161 sequenceDistances.initialize(Double.POSITIVE_INFINITY); 162 163 //Save the alignments so we do not need to recalculate those when aligning them again in feng doolittle algorithm 164 SmithWatermanRepeated[][] alignments = new SmithWatermanRepeated[numberseqs.size()][numberseqs.size()]; 162 165 163 166 for (int i = 0; i < numberseqs.size(); i++) { … … 169 172 int smithWatermanThreshold = 10; 170 173 171 SmithWatermanRepeated twoSequences= new SmithWatermanRepeated(174 alignments[i][j] = new SmithWatermanRepeated( 172 175 ns1.getSequence(), ns2.getSequence(), submat, 173 176 smithWatermanThreshold); … … 182 185 183 186 // Score of the aligmnment 184 double score = twoSequences.getAlignmentScore();187 double score = alignments[i][j].getAlignmentScore(); 185 188 // Scores of the sequence being aligned to itself (maximum score) 186 189 double sSelf1 = sameSequence1.getAlignmentScore();
Note: See TracChangeset
for help on using the changeset viewer.