- Timestamp:
- 08/12/14 22:40:30 (10 years ago)
- Location:
- branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment
- Files:
-
- 2 deleted
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/MatchOccurence.java
r1657 r1667 20 20 } 21 21 22 23 22 public int getStartindex() { 24 23 return startindex; -
branches/autoquest-core-tasktrees-alignment/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/matrix/PairwiseAlignmentGenerator.java
r1655 r1667 31 31 smithWatermanThreshold); 32 32 alignments.set(i, j, aa); 33 //TODO: This is old code used for generating pairwise distances between alignments (to build34 // a guide tree35 /*36 AlignmentAlgorithm sameSequence1 = AlignmentAlgorithmFactory37 .create();38 sameSequence1.align(ns1, ns1,39 submat, smithWatermanThreshold);40 AlignmentAlgorithm sameSequence2 = AlignmentAlgorithmFactory41 .create();42 sameSequence2.align(ns2, ns2,43 submat, smithWatermanThreshold);44 AlignmentAlgorithm randomSequence = AlignmentAlgorithmFactory45 .create();46 randomSequence.align(ns1.shuffle(), ns247 .shuffle(), submat,48 smithWatermanThreshold);49 50 // Score of the aligmnment51 double score = alignments.get(i, j).getAlignmentScore();52 53 54 // Scores of the sequence being aligned to itself (maximum55 // score)56 double sSelf1 = sameSequence1.getAlignmentScore();57 double sSelf2 = sameSequence2.getAlignmentScore();58 // Score of sequences shuffled before aligned59 double sRand = randomSequence.getAlignmentScore();60 61 double sMax = (sSelf1 + sSelf2) / 2;62 double sEff = (score - sRand) / (sMax - sRand);63 if (sEff < 0) {64 sEff = 0;65 }66 double distance = -Math.log(sEff);67 68 if (!Double.isInfinite(distance) && !Double.isNaN(distance)) {69 if (distance < alignments.getDistance(i, j)) {70 alignments.setDistance(i, j, distance);71 }72 }73 */74 33 } 75 34 }
Note: See TracChangeset
for help on using the changeset viewer.