Ignore:
Timestamp:
06/27/14 15:25:25 (10 years ago)
Author:
rkrimmel
Message:

Some refactoring for storing the initial alignments so we don't need to do them again.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • branches/ralph/src/main/java/de/ugoe/cs/autoquest/tasktrees/alignment/pal/tree/UPGMAAligningTree.java

    r1579 r1584  
    1717 
    1818import de.ugoe.cs.autoquest.tasktrees.alignment.algorithms.NumberSequence; 
     19import de.ugoe.cs.autoquest.tasktrees.alignment.matrix.BinaryAlignmentStorage; 
    1920import de.ugoe.cs.autoquest.tasktrees.alignment.matrix.UPGMAMatrix; 
    2021import de.ugoe.cs.autoquest.tasktrees.alignment.pal.misc.Identifier; 
     
    4142         * @param m distance matrix 
    4243         */ 
    43         public UPGMAAligningTree(ArrayList<NumberSequence> numberseqs, UPGMAMatrix m) 
    44         { 
    45                 if (m.size() < 2) 
     44        public UPGMAAligningTree(ArrayList<NumberSequence> numberseqs, BinaryAlignmentStorage alignments) 
     45        { 
     46                if (alignments.getDistanceMatrix().size() < 2) 
    4647                { 
    4748                        new IllegalArgumentException("LESS THAN 2 TAXA IN DISTANCE MATRIX"); 
     
    4950         
    5051                this.numberseqs = numberseqs; 
    51                 init(m); 
     52                this.alignments = alignments; 
     53                init(alignments.getDistanceMatrix()); 
    5254 
    5355                while (true) 
     
    7375        // 
    7476        private ArrayList<NumberSequence> numberseqs; 
     77        private BinaryAlignmentStorage alignments; 
    7578        private int numClusters; 
    7679        private int besti, abi; 
Note: See TracChangeset for help on using the changeset viewer.