Changeset 1588 for branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/NeedlemanWunsch.java

Timestamp:

07/08/14 21:38:11 (10 years ago)

Author:

rkrimmel

Message:

Fixed Needleman Wunsch Algorithm

File:

• branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/NeedlemanWunsch.java (modified) (4 diffs)

branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/algorithms/NeedlemanWunsch.java

@@ -2 +2 @@
 
 import java.util.ArrayList;
-import java.util.logging.Level;
+import java.util.Iterator;
+import java.util.LinkedList;
 
 import de.ugoe.cs.autoquest.tasktrees.alignment.matrix.SubstitutionMatrix;
 import de.ugoe.cs.autoquest.tasktrees.alignment.algorithms.Constants;
-import de.ugoe.cs.util.console.Console;
+
 
 public class NeedlemanWunsch implements AlignmentAlgorithm {
@@ -116 +117 @@
 
                                 matrix[i][j].setScore(Math.max(diagScore,
-                                                Math.max(upScore, Math.max(leftScore, 0))));
+                                                Math.max(upScore, leftScore)));
 
                                 // find the directions that give the maximum scores.
@@ -175 +176 @@
         public void traceback() {
                 MatrixEntry tmp = matrix[length1][length2];
-                int aligned1[] = new int[length1 + length2 + 2];
-                int aligned2[] = new int[length1 + length2 + 2];
+                LinkedList<Integer> aligned1 = new LinkedList<Integer>();
+                LinkedList<Integer> aligned2 = new LinkedList<Integer>();
+                do {
+                        
+                        aligned1.add(new Integer(tmp.getXvalue()));
+                        aligned2.add(new Integer(tmp.getYvalue()));
+
+                        tmp = tmp.getPrevious();
+
+                } while (tmp != null);
+                
+                // reverse order of the alignment
+                int reversed1[] = new int[aligned1.size()];
+                int reversed2[] = new int[aligned2.size()];
+
                 int count = 0;
-                do {
-                        if (length1 + length2 + 2 == count) {
-                                Console.traceln(Level.WARNING,
-                                                "Traceback longer than both sequences summed up!");
-                                break;
-                        }
-                        aligned1[count] = tmp.getXvalue();
-                        aligned2[count] = tmp.getYvalue();
-
-                        tmp = tmp.getPrevious();
+                for (Iterator<Integer> it = aligned1.descendingIterator(); it.hasNext();) {
                         count++;
-
-                } while (tmp != null);
-                count--;
-                // reverse order of the alignment
-                int reversed1[] = new int[count];
-                int reversed2[] = new int[count];
-
-                for (int i = count; i > 0; i--) {
-                        reversed1[reversed1.length - i] = aligned1[i];
-                        reversed2[reversed2.length - i] = aligned2[i];
+                        reversed1[reversed1.length - count] = it.next();
+                        
+                }
+                count = 0;
+                for (Iterator<Integer> it = aligned2.descendingIterator(); it.hasNext();) {
+                        count++;
+                        reversed2[reversed2.length - count] = it.next();
                 }
 
@@ -216 +218 @@
                 int count = 0;
                 do {
+                        System.out.println(tmp);
                         String append1 = "";
                         String append2 = "";