Index: /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/FengDoolittleNode.java
===================================================================
--- /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/FengDoolittleNode.java	(revision 1576)
+++ /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/FengDoolittleNode.java	(revision 1577)
@@ -165,4 +165,9 @@
 	}
 
+	public void addSequence(NumberSequence s) {
+		sequences.add(s);
+	}
+	
+	
 	/**
 	 * Returns the sequence at this node, in the form of a String.
@@ -424,4 +429,6 @@
 		newNode.addChild(child1);
 		newNode.addChild(child2);
+		newNode.setIdentifier(new Identifier(child1.getIdentifier().getName() + " " + child2.getIdentifier().getName()));
+		System.out.println("Merging " + child1.getIdentifier() + " with " + child2.getIdentifier());
 		
 		if(newNode instanceof FengDoolittleNode) {
Index: /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/Node.java
===================================================================
--- /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/Node.java	(revision 1576)
+++ /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/Node.java	(revision 1577)
@@ -137,4 +137,6 @@
 	void joinChildren( int n1, int n2);
 
+	void addSequence(NumberSequence numberSequence);
+
 
 	
Index: /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/UPGMATree.java
===================================================================
--- /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/UPGMATree.java	(revision 1576)
+++ /branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/UPGMATree.java	(revision 1577)
@@ -48,5 +48,5 @@
 		}
 	
-		
+		this.numberseqs = numberseqs;
 		init(m);
 
@@ -104,5 +104,5 @@
 			Node tmp = NodeFactory.createNode();
 			tmp.setIdentifier(new Identifier(Integer.toString(i)));
-			tmp.setSequence(0, numberseqs.get(i));
+			tmp.addSequence(numberseqs.get(i));
 			getRoot().addChild(tmp);
 		}
@@ -147,5 +147,5 @@
 		abi = alias[besti];
 		abj = alias[bestj];
-		System.out.println("Found best pair: " + abi + "/" +abj + " - "+ besti+ "/"+bestj +" with distance " + dmin);
+		//System.out.println("Found best pair: " + abi + "/" +abj + " - "+ besti+ "/"+bestj +" with distance " + dmin);
 		
 	}