4 // FORESTER -- software libraries and applications
5 // for evolutionary biology research and applications.
7 // Copyright (C) 2008-2009 Christian M. Zmasek
8 // Copyright (C) 2008-2009 Burnham Institute for Medical Research
11 // This library is free software; you can redistribute it and/or
12 // modify it under the terms of the GNU Lesser General Public
13 // License as published by the Free Software Foundation; either
14 // version 2.1 of the License, or (at your option) any later version.
16 // This library is distributed in the hope that it will be useful,
17 // but WITHOUT ANY WARRANTY; without even the implied warranty of
18 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 // Lesser General Public License for more details.
21 // You should have received a copy of the GNU Lesser General Public
22 // License along with this library; if not, write to the Free Software
23 // Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
25 // Contact: phylosoft @ gmail . com
26 // WWW: https://sites.google.com/site/cmzmasek/home/software/forester
28 package org.forester.evoinference;
31 import java.io.FileInputStream;
32 import java.io.StringWriter;
33 import java.util.Date;
34 import java.util.List;
36 import org.forester.archaeopteryx.Archaeopteryx;
37 import org.forester.evoinference.distance.NeighborJoining;
38 import org.forester.evoinference.distance.PairwiseDistanceCalculator;
39 import org.forester.evoinference.matrix.character.BasicCharacterStateMatrix;
40 import org.forester.evoinference.matrix.character.CharacterStateMatrix;
41 import org.forester.evoinference.matrix.character.CharacterStateMatrix.BinaryStates;
42 import org.forester.evoinference.matrix.character.CharacterStateMatrix.GainLossStates;
43 import org.forester.evoinference.matrix.distance.BasicSymmetricalDistanceMatrix;
44 import org.forester.evoinference.matrix.distance.DistanceMatrix;
45 import org.forester.evoinference.parsimony.DolloParsimony;
46 import org.forester.evoinference.parsimony.FitchParsimony;
47 import org.forester.io.parsers.GeneralMsaParser;
48 import org.forester.io.parsers.SymmetricalDistanceMatrixParser;
49 import org.forester.io.parsers.nhx.NHXParser;
50 import org.forester.msa.Msa;
51 import org.forester.phylogeny.Phylogeny;
52 import org.forester.phylogeny.factories.ParserBasedPhylogenyFactory;
53 import org.forester.phylogeny.factories.PhylogenyFactory;
54 import org.forester.util.ForesterUtil;
56 public class TestPhylogenyReconstruction {
58 private final static double ZERO_DIFF = 1.0E-9;
59 private final static boolean TIME = false;
61 public static boolean isEqual( final double a, final double b ) {
62 return ( ( Math.abs( a - b ) ) < ZERO_DIFF );
65 public static void main( final String[] args ) {
66 testNeighborJoining();
67 // timeNeighborJoining();
70 public static boolean test( final File test_dir ) {
71 System.out.print( " Basic symmetrical distance matrix: " );
72 if ( !testBasicSymmetricalDistanceMatrix() ) {
73 System.out.println( "failed." );
76 System.out.println( "OK." );
77 System.out.print( " Basic character state matrix: " );
78 if ( !testBasicCharacterStateMatrix() ) {
79 System.out.println( "failed." );
82 System.out.println( "OK." );
83 System.out.print( " Symmetrical distance matrix parser: " );
84 if ( !testSymmetricalDistanceMatrixParser() ) {
85 System.out.println( "failed." );
88 System.out.println( "OK." );
89 System.out.print( " Distance Calculation: " );
90 if ( !testDistanceCalculationMethods( test_dir ) ) {
91 System.out.println( "failed." );
94 System.out.println( "OK." );
95 System.out.print( " Neighbor Joining: " );
96 if ( !testNeighborJoining() ) {
97 System.out.println( "failed." );
100 System.out.println( "OK." );
101 System.out.print( " Dollo Parsimony: " );
102 if ( !testDolloParsimony() ) {
103 System.out.println( "failed." );
106 System.out.println( "OK." );
107 System.out.print( " Dollo Parsimony on non binary trees: " );
108 if ( !testDolloParsimonyOnNonBinaryTree() ) {
109 System.out.println( "failed." );
112 System.out.println( "OK." );
113 System.out.print( " Fitch Parsimony: " );
114 if ( !testFitchParsimony() ) {
115 System.out.println( "failed." );
118 System.out.println( "OK." );
122 private static boolean testDistanceCalculationMethods( final File test_dir ) {
124 final Msa msa0 = GeneralMsaParser.parse( new FileInputStream( test_dir + ForesterUtil.FILE_SEPARATOR
126 final BasicSymmetricalDistanceMatrix pwd0 = PairwiseDistanceCalculator.calcKimuraDistances( msa0 );
127 if ( pwd0.getSize() != 120 ) {
130 for( int i = 0; i < pwd0.getSize(); ++i ) {
131 if ( !isEqual( pwd0.getValue( i, i ), 0.0 ) ) {
136 catch ( final Exception e ) {
137 e.printStackTrace( System.out );
143 private static boolean testBasicCharacterStateMatrix() {
145 final CharacterStateMatrix<String> matrix_0 = new BasicCharacterStateMatrix<String>( 4, 8 );
146 final CharacterStateMatrix<String> matrix_00 = new BasicCharacterStateMatrix<String>( 4, 8 );
147 matrix_0.setIdentifier( 0, "A" );
148 matrix_0.setIdentifier( 1, "B" );
149 matrix_0.setIdentifier( 2, "C" );
150 matrix_0.setIdentifier( 3, "D" );
151 matrix_0.setCharacter( 0, "0" );
152 matrix_0.setCharacter( 1, "1" );
153 matrix_0.setCharacter( 2, "2" );
154 matrix_0.setCharacter( 3, "3" );
155 matrix_0.setCharacter( 4, "4" );
156 matrix_0.setCharacter( 5, "5" );
157 matrix_0.setCharacter( 6, "6" );
158 matrix_0.setCharacter( 7, "7" );
159 matrix_00.setIdentifier( 0, "A" );
160 matrix_00.setIdentifier( 1, "B" );
161 matrix_00.setIdentifier( 2, "C" );
162 matrix_00.setIdentifier( 3, "D" );
163 matrix_00.setCharacter( 3, "3" );
164 matrix_00.setCharacter( 4, "4" );
165 if ( !matrix_0.getCharacter( 1 ).equals( "1" ) ) {
168 if ( !matrix_0.getIdentifier( 0 ).equals( "A" ) ) {
171 matrix_0.setState( 0, 0, "00" );
172 matrix_00.setState( 0, 0, "00" );
173 if ( !matrix_0.getState( 0, 0 ).equals( "00" ) ) {
176 matrix_0.setState( 0, 1, "01" );
177 matrix_00.setState( 0, 1, "01" );
178 if ( !matrix_0.getState( 0, 1 ).equals( "01" ) ) {
181 matrix_0.setState( 1, 1, "11" );
182 matrix_00.setState( 1, 1, "11" );
183 if ( !matrix_0.getState( 1, 1 ).equals( "11" ) ) {
186 matrix_0.setState( 1, 0, "10" );
187 matrix_00.setState( 1, 0, "10" );
188 if ( !matrix_0.getState( 1, 0 ).equals( "10" ) ) {
191 matrix_0.setState( 1, 2, "12" );
192 matrix_00.setState( 1, 2, "12" );
193 if ( !matrix_0.getState( 1, 2 ).equals( "12" ) ) {
196 matrix_0.setState( 3, 7, "37" );
197 matrix_00.setState( 3, 7, "37" );
198 if ( !matrix_0.getState( 3, 7 ).equals( "37" ) ) {
201 matrix_0.setState( 2, 6, "26" );
202 matrix_00.setState( 2, 6, "26" );
203 if ( !matrix_0.getState( 2, 6 ).equals( "26" ) ) {
206 matrix_0.setState( "D", "3", "33" );
207 matrix_00.setState( "D", "3", "33" );
208 if ( !matrix_0.getState( 3, 3 ).equals( "33" ) ) {
211 if ( !matrix_0.getState( "D", "3" ).equals( "33" ) ) {
214 matrix_0.setState( "C", "4", "24" );
215 matrix_00.setState( "C", "4", "24" );
216 if ( !matrix_0.getState( 2, 4 ).equals( "24" ) ) {
219 if ( !matrix_0.getState( "C", "4" ).equals( "24" ) ) {
222 if ( matrix_0.isEmpty() ) {
225 if ( matrix_0.getNumberOfIdentifiers() != 4 ) {
228 if ( matrix_0.getNumberOfCharacters() != 8 ) {
231 if ( !matrix_0.equals( matrix_0 ) ) {
234 if ( !matrix_0.equals( matrix_00 ) ) {
237 matrix_00.setState( "C", "4", "123" );
238 if ( matrix_0.equals( matrix_00 ) ) {
241 final Integer[][] ints = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 } };
242 final CharacterStateMatrix<Integer> matrix_000 = new BasicCharacterStateMatrix<Integer>( ints );
243 matrix_000.toString();
244 if ( matrix_000.getNumberOfCharacters() != 4 ) {
247 if ( matrix_000.getNumberOfIdentifiers() != 3 ) {
250 if ( matrix_000.getState( 0, 1 ) != 2 ) {
253 if ( matrix_000.getState( 2, 3 ) != 12 ) {
256 final Integer[][] ints0 = { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 } };
257 final CharacterStateMatrix<Integer> matrix_0000 = new BasicCharacterStateMatrix<Integer>( ints0 );
258 if ( !matrix_000.equals( matrix_0000 ) ) {
261 final Integer[][] ints00 = { { 1, 2, 3, -4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 } };
262 final CharacterStateMatrix<Integer> matrix_00000 = new BasicCharacterStateMatrix<Integer>( ints00 );
263 if ( matrix_000.equals( matrix_00000 ) ) {
266 final CharacterStateMatrix<String> clone0 = matrix_0.copy();
267 final CharacterStateMatrix<String> clone00 = matrix_00.copy();
268 if ( !clone0.equals( matrix_0 ) ) {
271 if ( !clone00.equals( matrix_00 ) ) {
274 if ( clone00.equals( clone0 ) ) {
277 final CharacterStateMatrix<String> pivot0 = matrix_0.pivot();
278 final CharacterStateMatrix<String> pivot00 = matrix_00.pivot();
279 if ( !pivot0.getState( 1, 0 ).equals( "01" ) ) {
282 if ( !pivot0.getState( 6, 2 ).equals( "26" ) ) {
285 if ( !matrix_0.getState( 2, 6 ).equals( "26" ) ) {
288 final CharacterStateMatrix<String> pivotpivot00 = pivot00.pivot();
289 if ( !pivotpivot00.equals( matrix_00 ) ) {
292 final CharacterStateMatrix<BinaryStates> nex = new BasicCharacterStateMatrix<BinaryStates>( 4, 3 );
293 nex.setIdentifier( 0, "amphioxus" );
294 nex.setIdentifier( 1, "sponge" );
295 nex.setIdentifier( 2, "sea_anemone" );
296 nex.setIdentifier( 3, "cobra" );
297 nex.setCharacter( 0, "notch" );
298 nex.setCharacter( 1, "homeobox" );
299 nex.setCharacter( 2, "wnt" );
300 nex.setState( 0, 0, BinaryStates.ABSENT );
301 nex.setState( 0, 1, BinaryStates.ABSENT );
302 nex.setState( 0, 2, BinaryStates.ABSENT );
303 nex.setState( 1, 0, BinaryStates.PRESENT );
304 nex.setState( 1, 1, BinaryStates.PRESENT );
305 nex.setState( 1, 2, BinaryStates.ABSENT );
306 nex.setState( 2, 0, BinaryStates.PRESENT );
307 nex.setState( 2, 1, BinaryStates.PRESENT );
308 nex.setState( 2, 2, BinaryStates.PRESENT );
309 nex.setState( 3, 0, BinaryStates.PRESENT );
310 nex.setState( 3, 1, BinaryStates.ABSENT );
311 nex.setState( 3, 2, BinaryStates.ABSENT );
312 StringWriter w = new StringWriter();
313 nex.toWriter( w, CharacterStateMatrix.Format.NEXUS_BINARY );
314 //System.out.println( w.getBuffer().toString() );
315 w = new StringWriter();
316 nex.pivot().toWriter( w, CharacterStateMatrix.Format.NEXUS_BINARY );
317 //System.out.println( w.getBuffer().toString() );
319 catch ( final Exception e ) {
320 e.printStackTrace( System.out );
326 private static boolean testBasicSymmetricalDistanceMatrix() {
328 final DistanceMatrix matrix_0 = new BasicSymmetricalDistanceMatrix( 4 );
329 matrix_0.setIdentifier( 0, "A" );
330 matrix_0.setIdentifier( 1, "B" );
331 matrix_0.setIdentifier( 2, "C" );
332 matrix_0.setIdentifier( 3, "0123456789012" );
333 matrix_0.setValue( 1, 0, 0.00001 );
334 matrix_0.setValue( 0, 2, 0.0000009 );
335 matrix_0.setValue( 3, 0, 3.0 );
336 matrix_0.setValue( 1, 2, 4.0 );
337 matrix_0.setValue( 3, 1, 5.0 );
338 matrix_0.setValue( 2, 3, 6.0 );
339 if ( !matrix_0.getIdentifier( 0 ).equals( "A" ) ) {
342 if ( !matrix_0.getIdentifier( 1 ).equals( "B" ) ) {
345 if ( !matrix_0.getIdentifier( 2 ).equals( "C" ) ) {
348 if ( !matrix_0.getIdentifier( 3 ).equals( "0123456789012" ) ) {
351 if ( matrix_0.getSize() != 4 ) {
354 if ( !isEqual( matrix_0.getValue( 0, 0 ), 0.0 ) ) {
357 if ( !isEqual( matrix_0.getValue( 3, 3 ), 0.0 ) ) {
360 if ( !isEqual( matrix_0.getValue( 0, 1 ), 0.00001 ) ) {
363 if ( !isEqual( matrix_0.getValue( 0, 2 ), 0.0000009 ) ) {
366 if ( !isEqual( matrix_0.getValue( 0, 3 ), 3 ) ) {
369 if ( !isEqual( matrix_0.getValue( 1, 0 ), 0.00001 ) ) {
372 if ( !isEqual( matrix_0.getValue( 1, 2 ), 4 ) ) {
375 if ( !isEqual( matrix_0.getValue( 1, 3 ), 5 ) ) {
378 if ( !isEqual( matrix_0.getValue( 2, 0 ), 0.0000009 ) ) {
381 if ( !isEqual( matrix_0.getValue( 2, 1 ), 4 ) ) {
384 if ( !isEqual( matrix_0.getValue( 2, 3 ), 6 ) ) {
387 if ( !isEqual( matrix_0.getValue( 3, 0 ), 3 ) ) {
390 if ( !isEqual( matrix_0.getValue( 3, 1 ), 5 ) ) {
393 if ( !isEqual( matrix_0.getValue( 3, 2 ), 6 ) ) {
396 final StringBuffer matrix_0_phylip = new StringBuffer();
397 matrix_0_phylip.append( " 4" );
398 matrix_0_phylip.append( ForesterUtil.LINE_SEPARATOR );
399 matrix_0_phylip.append( "A 0.000000 0.000010 0.000001 3.000000" );
400 matrix_0_phylip.append( ForesterUtil.LINE_SEPARATOR );
401 matrix_0_phylip.append( "B 0.000010 0.000000 4.000000 5.000000" );
402 matrix_0_phylip.append( ForesterUtil.LINE_SEPARATOR );
403 matrix_0_phylip.append( "C 0.000001 4.000000 0.000000 6.000000" );
404 matrix_0_phylip.append( ForesterUtil.LINE_SEPARATOR );
405 matrix_0_phylip.append( "0123456789 3.000000 5.000000 6.000000 0.000000" );
406 if ( !matrix_0_phylip.toString()
407 .equals( matrix_0.toStringBuffer( DistanceMatrix.Format.PHYLIP ).toString() ) ) {
411 catch ( final Exception e ) {
412 e.printStackTrace( System.out );
418 private static boolean testDolloParsimony() {
420 final BinaryStates PRESENT = BinaryStates.PRESENT;
421 final BinaryStates ABSENT = BinaryStates.ABSENT;
422 final GainLossStates UNCHANGED_PRESENT = GainLossStates.UNCHANGED_PRESENT;
423 final DolloParsimony dollo1 = DolloParsimony.createInstance();
424 final PhylogenyFactory factory1 = ParserBasedPhylogenyFactory.getInstance();
425 final String p1_str = "((((((a,b)ab,c)ac,d)ad,(e,f)ef)af,(g,h)gh)ah,i)r";
426 final Phylogeny p1 = factory1.create( p1_str, new NHXParser() )[ 0 ];
427 CharacterStateMatrix<CharacterStateMatrix.BinaryStates> m1 = new BasicCharacterStateMatrix<CharacterStateMatrix.BinaryStates>( 9,
429 m1.setIdentifier( 0, "a" );
430 m1.setIdentifier( 1, "b" );
431 m1.setIdentifier( 2, "c" );
432 m1.setIdentifier( 3, "d" );
433 m1.setIdentifier( 4, "e" );
434 m1.setIdentifier( 5, "f" );
435 m1.setIdentifier( 6, "g" );
436 m1.setIdentifier( 7, "h" );
437 m1.setIdentifier( 8, "i" );
438 m1.setCharacter( 0, "0" );
439 m1.setState( "a", "0", PRESENT );
440 m1.setState( "b", "0", ABSENT );
441 m1.setState( "c", "0", PRESENT );
442 m1.setState( "d", "0", ABSENT );
443 m1.setState( "e", "0", ABSENT );
444 m1.setState( "f", "0", ABSENT );
445 m1.setState( "g", "0", ABSENT );
446 m1.setState( "h", "0", ABSENT );
447 m1.setState( "i", "0", ABSENT );
448 dollo1.execute( p1, m1 );
449 if ( dollo1.getTotalGains() != 1 ) {
452 if ( dollo1.getTotalLosses() != 1 ) {
455 if ( dollo1.getTotalUnchanged() != 15 ) {
458 m1.setState( "b", "0", PRESENT );
459 dollo1.execute( p1, m1 );
460 if ( dollo1.getTotalGains() != 1 ) {
463 if ( dollo1.getTotalLosses() != 0 ) {
466 if ( dollo1.getTotalUnchanged() != 16 ) {
469 m1.setState( "b", "0", ABSENT );
470 m1.setState( "e", "0", PRESENT );
471 dollo1.execute( p1, m1 );
472 if ( dollo1.getTotalGains() != 1 ) {
475 if ( dollo1.getTotalLosses() != 3 ) {
478 if ( dollo1.getTotalUnchanged() != 13 ) {
481 m1.setState( "a", "0", ABSENT );
482 m1.setState( "c", "0", ABSENT );
483 m1.setState( "g", "0", PRESENT );
484 dollo1.setReturnInternalStates( true );
485 dollo1.setReturnGainLossMatrix( true );
486 dollo1.execute( p1, m1 );
487 if ( dollo1.getTotalGains() != 1 ) {
490 if ( dollo1.getTotalLosses() != 3 ) {
493 if ( dollo1.getTotalUnchanged() != 13 ) {
496 final DolloParsimony dollo2 = DolloParsimony.createInstance();
497 final PhylogenyFactory factory2 = ParserBasedPhylogenyFactory.getInstance();
498 final String p2_str = "((((((a,b)ab,c)ac,d)ad,(e,f)ef)af,(g,h,i)gi)ai,((j,k,l)jl,(m,n,o)mo,(p,q,r)pr)jr)root";
499 final Phylogeny p2 = factory2.create( p2_str, new NHXParser() )[ 0 ];
500 final CharacterStateMatrix<CharacterStateMatrix.BinaryStates> m2 = new BasicCharacterStateMatrix<CharacterStateMatrix.BinaryStates>( 18,
502 m2.setIdentifier( 0, "a" );
503 m2.setIdentifier( 1, "b" );
504 m2.setIdentifier( 2, "c" );
505 m2.setIdentifier( 3, "d" );
506 m2.setIdentifier( 4, "e" );
507 m2.setIdentifier( 5, "f" );
508 m2.setIdentifier( 6, "g" );
509 m2.setIdentifier( 7, "h" );
510 m2.setIdentifier( 8, "i" );
511 m2.setIdentifier( 9, "j" );
512 m2.setIdentifier( 10, "k" );
513 m2.setIdentifier( 11, "l" );
514 m2.setIdentifier( 12, "m" );
515 m2.setIdentifier( 13, "n" );
516 m2.setIdentifier( 14, "o" );
517 m2.setIdentifier( 15, "p" );
518 m2.setIdentifier( 16, "q" );
519 m2.setIdentifier( 17, "r" );
520 m2.setCharacter( 0, "0" );
521 m2.setCharacter( 1, "1" );
522 m2.setCharacter( 2, "2" );
523 m2.setCharacter( 3, "3" );
524 m2.setState( "a", "0", PRESENT );
525 m2.setState( "b", "0", ABSENT );
526 m2.setState( "c", "0", PRESENT );
527 m2.setState( "d", "0", ABSENT );
528 m2.setState( "e", "0", ABSENT );
529 m2.setState( "f", "0", ABSENT );
530 m2.setState( "g", "0", ABSENT );
531 m2.setState( "h", "0", ABSENT );
532 m2.setState( "i", "0", ABSENT );
533 m2.setState( "j", "0", ABSENT );
534 m2.setState( "k", "0", ABSENT );
535 m2.setState( "l", "0", ABSENT );
536 m2.setState( "m", "0", ABSENT );
537 m2.setState( "n", "0", ABSENT );
538 m2.setState( "o", "0", ABSENT );
539 m2.setState( "p", "0", ABSENT );
540 m2.setState( "q", "0", ABSENT );
541 m2.setState( "r", "0", ABSENT );
542 m2.setState( "a", "1", PRESENT );
543 m2.setState( "b", "1", ABSENT );
544 m2.setState( "c", "1", PRESENT );
545 m2.setState( "d", "1", ABSENT );
546 m2.setState( "e", "1", ABSENT );
547 m2.setState( "f", "1", ABSENT );
548 m2.setState( "g", "1", PRESENT );
549 m2.setState( "h", "1", ABSENT );
550 m2.setState( "i", "1", ABSENT );
551 m2.setState( "j", "1", PRESENT );
552 m2.setState( "k", "1", ABSENT );
553 m2.setState( "l", "1", ABSENT );
554 m2.setState( "m", "1", PRESENT );
555 m2.setState( "n", "1", ABSENT );
556 m2.setState( "o", "1", ABSENT );
557 m2.setState( "p", "1", ABSENT );
558 m2.setState( "q", "1", ABSENT );
559 m2.setState( "r", "1", ABSENT );
560 m2.setState( "a", "2", ABSENT );
561 m2.setState( "b", "2", ABSENT );
562 m2.setState( "c", "2", ABSENT );
563 m2.setState( "d", "2", ABSENT );
564 m2.setState( "e", "2", ABSENT );
565 m2.setState( "f", "2", ABSENT );
566 m2.setState( "g", "2", ABSENT );
567 m2.setState( "h", "2", ABSENT );
568 m2.setState( "i", "2", ABSENT );
569 m2.setState( "j", "2", PRESENT );
570 m2.setState( "k", "2", ABSENT );
571 m2.setState( "l", "2", ABSENT );
572 m2.setState( "m", "2", PRESENT );
573 m2.setState( "n", "2", ABSENT );
574 m2.setState( "o", "2", ABSENT );
575 m2.setState( "p", "2", PRESENT );
576 m2.setState( "q", "2", ABSENT );
577 m2.setState( "r", "2", ABSENT );
578 m2.setState( "a", "3", ABSENT );
579 m2.setState( "b", "3", ABSENT );
580 m2.setState( "c", "3", PRESENT );
581 m2.setState( "d", "3", ABSENT );
582 m2.setState( "e", "3", ABSENT );
583 m2.setState( "f", "3", ABSENT );
584 m2.setState( "g", "3", PRESENT );
585 m2.setState( "h", "3", ABSENT );
586 m2.setState( "i", "3", ABSENT );
587 m2.setState( "j", "3", ABSENT );
588 m2.setState( "k", "3", ABSENT );
589 m2.setState( "l", "3", ABSENT );
590 m2.setState( "m", "3", ABSENT );
591 m2.setState( "n", "3", ABSENT );
592 m2.setState( "o", "3", ABSENT );
593 m2.setState( "p", "3", ABSENT );
594 m2.setState( "q", "3", ABSENT );
595 m2.setState( "r", "3", ABSENT );
596 dollo2.setReturnInternalStates( true );
597 dollo2.setReturnGainLossMatrix( true );
598 dollo2.execute( p2, m2 );
599 final CharacterStateMatrix<BinaryStates> i_m = dollo2.getInternalStatesMatrix();
600 final CharacterStateMatrix<GainLossStates> gl_m = dollo2.getGainLossMatrix();
601 if ( dollo2.getTotalGains() != 3 ) {
604 if ( dollo2.getTotalLosses() != 22 ) {
607 if ( dollo2.getTotalUnchanged() != 95 ) {
610 if ( i_m.getState( "ab", "0" ) != PRESENT ) {
613 if ( i_m.getState( "ac", "0" ) != PRESENT ) {
616 if ( i_m.getState( "ad", "0" ) != ABSENT ) {
619 if ( i_m.getState( "af", "0" ) != ABSENT ) {
622 if ( i_m.getState( "ef", "0" ) != ABSENT ) {
625 if ( i_m.getState( "ai", "0" ) != ABSENT ) {
628 if ( i_m.getState( "gi", "0" ) != ABSENT ) {
631 if ( i_m.getState( "jl", "0" ) != ABSENT ) {
634 if ( i_m.getState( "mo", "0" ) != ABSENT ) {
637 if ( i_m.getState( "pr", "0" ) != ABSENT ) {
640 if ( i_m.getState( "jr", "0" ) != ABSENT ) {
643 if ( i_m.getState( "root", "0" ) != ABSENT ) {
646 if ( i_m.getState( "ab", "1" ) != PRESENT ) {
649 if ( i_m.getState( "ac", "1" ) != PRESENT ) {
652 if ( i_m.getState( "ad", "1" ) != PRESENT ) {
655 if ( i_m.getState( "af", "1" ) != PRESENT ) {
658 if ( i_m.getState( "ef", "1" ) != ABSENT ) {
661 if ( i_m.getState( "ai", "1" ) != PRESENT ) {
664 if ( i_m.getState( "gi", "1" ) != PRESENT ) {
667 if ( i_m.getState( "jl", "1" ) != PRESENT ) {
670 if ( i_m.getState( "mo", "1" ) != PRESENT ) {
673 if ( i_m.getState( "pr", "1" ) != ABSENT ) {
676 if ( i_m.getState( "jr", "1" ) != PRESENT ) {
679 if ( i_m.getState( "root", "1" ) != PRESENT ) {
682 if ( i_m.getState( "ab", "2" ) != ABSENT ) {
685 if ( i_m.getState( "ac", "2" ) != ABSENT ) {
688 if ( i_m.getState( "ad", "2" ) != ABSENT ) {
691 if ( i_m.getState( "af", "2" ) != ABSENT ) {
694 if ( i_m.getState( "ef", "2" ) != ABSENT ) {
697 if ( i_m.getState( "ai", "2" ) != ABSENT ) {
700 if ( i_m.getState( "gi", "2" ) != ABSENT ) {
703 if ( i_m.getState( "jl", "2" ) != PRESENT ) {
706 if ( i_m.getState( "mo", "2" ) != PRESENT ) {
709 if ( i_m.getState( "pr", "2" ) != PRESENT ) {
712 if ( i_m.getState( "jr", "2" ) != PRESENT ) {
715 if ( i_m.getState( "root", "2" ) != ABSENT ) {
718 if ( i_m.getState( "ab", "3" ) != ABSENT ) {
721 if ( i_m.getState( "ac", "3" ) != PRESENT ) {
724 if ( i_m.getState( "ad", "3" ) != PRESENT ) {
727 if ( i_m.getState( "af", "3" ) != PRESENT ) {
730 if ( i_m.getState( "ef", "3" ) != ABSENT ) {
733 if ( i_m.getState( "ai", "3" ) != PRESENT ) {
736 if ( i_m.getState( "gi", "3" ) != PRESENT ) {
739 if ( i_m.getState( "jl", "3" ) != ABSENT ) {
742 if ( i_m.getState( "mo", "3" ) != ABSENT ) {
745 if ( i_m.getState( "pr", "3" ) != ABSENT ) {
748 if ( i_m.getState( "jr", "3" ) != ABSENT ) {
751 if ( i_m.getState( "root", "3" ) != ABSENT ) {
754 if ( gl_m.getState( "a", "0" ) != UNCHANGED_PRESENT ) {
757 final DolloParsimony dollo9 = DolloParsimony.createInstance();
758 final PhylogenyFactory factory9 = ParserBasedPhylogenyFactory.getInstance();
759 final String p9_str = "((((((a,b)ab,c)ac,d)ad,(e,f)ef)af,(g,h)gh)ah,i)r";
760 final Phylogeny p9 = factory9.create( p9_str, new NHXParser() )[ 0 ];
761 m1 = new BasicCharacterStateMatrix<CharacterStateMatrix.BinaryStates>( 9, 3 );
762 m1.setIdentifier( 0, "a" );
763 m1.setIdentifier( 1, "b" );
764 m1.setIdentifier( 2, "c" );
765 m1.setIdentifier( 3, "d" );
766 m1.setIdentifier( 4, "e" );
767 m1.setIdentifier( 5, "f" );
768 m1.setIdentifier( 6, "g" );
769 m1.setIdentifier( 7, "h" );
770 m1.setIdentifier( 8, "i" );
771 m1.setState( 0, 0, PRESENT );
772 m1.setState( 1, 0, ABSENT );
773 m1.setState( 2, 0, PRESENT );
774 m1.setState( 3, 0, ABSENT );
775 m1.setState( 4, 0, ABSENT );
776 m1.setState( 5, 0, ABSENT );
777 m1.setState( 6, 0, ABSENT );
778 m1.setState( 7, 0, ABSENT );
779 m1.setState( 8, 0, ABSENT );
780 m1.setState( 0, 1, PRESENT );
781 m1.setState( 1, 1, PRESENT );
782 m1.setState( 2, 1, PRESENT );
783 m1.setState( 3, 1, PRESENT );
784 m1.setState( 4, 1, ABSENT );
785 m1.setState( 5, 1, ABSENT );
786 m1.setState( 6, 1, ABSENT );
787 m1.setState( 7, 1, ABSENT );
788 m1.setState( 8, 1, ABSENT );
789 m1.setState( 0, 2, PRESENT );
790 m1.setState( 1, 2, ABSENT );
791 m1.setState( 2, 2, ABSENT );
792 m1.setState( 3, 2, ABSENT );
793 m1.setState( 4, 2, ABSENT );
794 m1.setState( 5, 2, ABSENT );
795 m1.setState( 6, 2, ABSENT );
796 m1.setState( 7, 2, PRESENT );
797 m1.setState( 8, 2, ABSENT );
798 dollo9.execute( p9, m1 );
799 if ( dollo9.getTotalGains() != 3 ) {
802 if ( dollo9.getTotalLosses() != 6 ) {
805 final DolloParsimony dollo10 = DolloParsimony.createInstance();
806 final PhylogenyFactory factory10 = ParserBasedPhylogenyFactory.getInstance();
807 final String p10_str = "((((((a,b)ab,c)ac,d)ad,(e,f)ef)af,(g,h)gh)ah,i)r";
808 final Phylogeny p10 = factory10.create( p10_str, new NHXParser() )[ 0 ];
809 final CharacterStateMatrix<CharacterStateMatrix.BinaryStates> m10 = new BasicCharacterStateMatrix<CharacterStateMatrix.BinaryStates>( 9,
811 m10.setIdentifier( 0, "a" );
812 m10.setIdentifier( 1, "b" );
813 m10.setIdentifier( 2, "c" );
814 m10.setIdentifier( 3, "d" );
815 m10.setIdentifier( 4, "e" );
816 m10.setIdentifier( 5, "f" );
817 m10.setIdentifier( 6, "g" );
818 m10.setIdentifier( 7, "h" );
819 m10.setIdentifier( 8, "i" );
820 m10.setState( 0, 0, PRESENT );
821 m10.setState( 1, 0, ABSENT );
822 m10.setState( 2, 0, PRESENT );
823 m10.setState( 3, 0, ABSENT );
824 m10.setState( 4, 0, ABSENT );
825 m10.setState( 5, 0, ABSENT );
826 m10.setState( 6, 0, ABSENT );
827 m10.setState( 7, 0, ABSENT );
828 m10.setState( 8, 0, ABSENT );
829 dollo10.execute( p10, m10 );
830 if ( dollo10.getTotalGains() != 1 ) {
833 if ( dollo10.getTotalLosses() != 1 ) {
837 catch ( final Exception e ) {
838 e.printStackTrace( System.out );
844 private static boolean testDolloParsimonyOnNonBinaryTree() {
846 final BinaryStates PRESENT = BinaryStates.PRESENT;
847 final BinaryStates ABSENT = BinaryStates.ABSENT;
848 final DolloParsimony dollo1 = DolloParsimony.createInstance();
849 final PhylogenyFactory factory1 = ParserBasedPhylogenyFactory.getInstance();
850 final String p1_str = "((((((a,b,y)aby,c)ac,d)ad,(e,f)ef)af,(g,h)gh)ah,i)r";
851 final Phylogeny p1 = factory1.create( p1_str, new NHXParser() )[ 0 ];
852 final CharacterStateMatrix<CharacterStateMatrix.BinaryStates> m1 = new BasicCharacterStateMatrix<CharacterStateMatrix.BinaryStates>( 10,
854 m1.setIdentifier( 0, "a" );
855 m1.setIdentifier( 1, "b" );
856 m1.setIdentifier( 2, "y" );
857 m1.setIdentifier( 3, "c" );
858 m1.setIdentifier( 4, "d" );
859 m1.setIdentifier( 5, "e" );
860 m1.setIdentifier( 6, "f" );
861 m1.setIdentifier( 7, "g" );
862 m1.setIdentifier( 8, "h" );
863 m1.setIdentifier( 9, "i" );
864 m1.setCharacter( 0, "0" );
865 m1.setState( "a", "0", PRESENT );
866 m1.setState( "b", "0", ABSENT );
867 m1.setState( "y", "0", PRESENT );
868 m1.setState( "c", "0", PRESENT );
869 m1.setState( "d", "0", ABSENT );
870 m1.setState( "e", "0", ABSENT );
871 m1.setState( "f", "0", ABSENT );
872 m1.setState( "g", "0", ABSENT );
873 m1.setState( "h", "0", ABSENT );
874 m1.setState( "i", "0", ABSENT );
875 dollo1.execute( p1, m1 );
876 if ( dollo1.getTotalGains() != 1 ) {
879 if ( dollo1.getTotalLosses() != 1 ) {
882 if ( dollo1.getTotalUnchanged() != 16 ) {
885 m1.setState( "b", "0", PRESENT );
886 dollo1.execute( p1, m1 );
887 if ( dollo1.getTotalGains() != 1 ) {
890 if ( dollo1.getTotalLosses() != 0 ) {
893 if ( dollo1.getTotalUnchanged() != 17 ) {
896 m1.setState( "a", "0", ABSENT );
897 m1.setState( "b", "0", ABSENT );
898 dollo1.execute( p1, m1 );
899 if ( dollo1.getTotalGains() != 1 ) {
902 if ( dollo1.getTotalLosses() != 2 ) {
905 if ( dollo1.getTotalUnchanged() != 15 ) {
908 m1.setState( "y", "0", ABSENT );
909 dollo1.execute( p1, m1 );
910 if ( dollo1.getTotalGains() != 1 ) {
913 if ( dollo1.getTotalLosses() != 0 ) {
916 if ( dollo1.getTotalUnchanged() != 17 ) {
919 final DolloParsimony dollo2 = DolloParsimony.createInstance();
920 final PhylogenyFactory factory2 = ParserBasedPhylogenyFactory.getInstance();
921 final String p2_str = "((((((a,b,y)aby,c,d)cad,e,f)af,(g,h)gh)ah,i))r";
922 final Phylogeny p2 = factory2.create( p2_str, new NHXParser() )[ 0 ];
923 final CharacterStateMatrix<CharacterStateMatrix.BinaryStates> m2 = new BasicCharacterStateMatrix<CharacterStateMatrix.BinaryStates>( 10,
925 m2.setIdentifier( 0, "a" );
926 m2.setIdentifier( 1, "b" );
927 m2.setIdentifier( 2, "y" );
928 m2.setIdentifier( 3, "c" );
929 m2.setIdentifier( 4, "d" );
930 m2.setIdentifier( 5, "e" );
931 m2.setIdentifier( 6, "f" );
932 m2.setIdentifier( 7, "g" );
933 m2.setIdentifier( 8, "h" );
934 m2.setIdentifier( 9, "i" );
935 m2.setCharacter( 0, "0" );
936 m2.setState( "a", "0", PRESENT );
937 m2.setState( "b", "0", ABSENT );
938 m2.setState( "y", "0", PRESENT );
939 m2.setState( "c", "0", PRESENT );
940 m2.setState( "d", "0", ABSENT );
941 m2.setState( "e", "0", ABSENT );
942 m2.setState( "f", "0", ABSENT );
943 m2.setState( "g", "0", ABSENT );
944 m2.setState( "h", "0", ABSENT );
945 m2.setState( "i", "0", ABSENT );
946 dollo2.setReturnInternalStates( true );
947 dollo2.execute( p2, m2 );
948 CharacterStateMatrix<BinaryStates> i_m2 = dollo2.getInternalStatesMatrix();
949 if ( i_m2.getState( "aby", "0" ) != PRESENT ) {
952 if ( i_m2.getState( "cad", "0" ) != PRESENT ) {
955 if ( i_m2.getState( "af", "0" ) != ABSENT ) {
958 if ( i_m2.getState( "gh", "0" ) != ABSENT ) {
961 if ( i_m2.getState( "ah", "0" ) != ABSENT ) {
964 if ( i_m2.getState( "r", "0" ) != ABSENT ) {
967 if ( dollo2.getTotalGains() != 1 ) {
970 if ( dollo2.getTotalLosses() != 2 ) {
973 if ( dollo2.getTotalUnchanged() != 14 ) {
976 m2.setState( "b", "0", PRESENT );
977 dollo2.execute( p2, m2 );
978 if ( dollo2.getTotalGains() != 1 ) {
981 if ( dollo2.getTotalLosses() != 1 ) {
984 if ( dollo2.getTotalUnchanged() != 15 ) {
987 m2.setState( "a", "0", ABSENT );
988 m2.setState( "b", "0", ABSENT );
989 dollo2.execute( p2, m2 );
990 if ( dollo2.getTotalGains() != 1 ) {
993 if ( dollo2.getTotalLosses() != 3 ) {
996 if ( dollo2.getTotalUnchanged() != 13 ) {
999 m2.setState( "y", "0", ABSENT );
1000 dollo2.execute( p2, m2 );
1001 if ( dollo2.getTotalGains() != 1 ) {
1004 if ( dollo2.getTotalLosses() != 0 ) {
1007 if ( dollo2.getTotalUnchanged() != 16 ) {
1010 m2.setState( "c", "0", ABSENT );
1011 dollo2.execute( p2, m2 );
1012 if ( dollo2.getTotalGains() != 0 ) {
1015 if ( dollo2.getTotalLosses() != 0 ) {
1018 if ( dollo2.getTotalUnchanged() != 17 ) {
1021 m2.setState( "y", "0", PRESENT );
1022 m2.setState( "e", "0", PRESENT );
1023 dollo2.execute( p2, m2 );
1024 if ( dollo2.getTotalGains() != 1 ) {
1027 if ( dollo2.getTotalLosses() != 5 ) {
1030 if ( dollo2.getTotalUnchanged() != 11 ) {
1033 i_m2 = dollo2.getInternalStatesMatrix();
1034 if ( i_m2.getState( "aby", "0" ) != PRESENT ) {
1037 if ( i_m2.getState( "cad", "0" ) != PRESENT ) {
1040 if ( i_m2.getState( "af", "0" ) != PRESENT ) {
1043 if ( i_m2.getState( "gh", "0" ) != ABSENT ) {
1046 if ( i_m2.getState( "ah", "0" ) != ABSENT ) {
1049 if ( i_m2.getState( "r", "0" ) != ABSENT ) {
1053 catch ( final Exception e ) {
1054 e.printStackTrace( System.out );
1060 private static boolean testFitchParsimony() {
1062 final BinaryStates PRESENT = BinaryStates.PRESENT;
1063 final BinaryStates ABSENT = BinaryStates.ABSENT;
1064 final GainLossStates GAIN = GainLossStates.GAIN;
1065 final GainLossStates LOSS = GainLossStates.LOSS;
1066 final GainLossStates UNCHANGED_PRESENT = GainLossStates.UNCHANGED_PRESENT;
1067 final GainLossStates UNCHANGED_ABSENT = GainLossStates.UNCHANGED_ABSENT;
1068 final FitchParsimony<String> fitch1 = new FitchParsimony<String>();
1069 final PhylogenyFactory factory1 = ParserBasedPhylogenyFactory.getInstance();
1070 final String p1_str = "((((((a,b)ab,c)ac,d)ad,(e,f)ef)af,(g,h,i)gi)ai,((j,k,l)jl,(m,n,o)mo,(p,q,r)pr)jr)root";
1071 final Phylogeny p1 = factory1.create( p1_str, new NHXParser() )[ 0 ];
1072 final CharacterStateMatrix<String> m1 = new BasicCharacterStateMatrix<String>( 18, 1 );
1073 m1.setIdentifier( 0, "a" );
1074 m1.setIdentifier( 1, "b" );
1075 m1.setIdentifier( 2, "c" );
1076 m1.setIdentifier( 3, "d" );
1077 m1.setIdentifier( 4, "e" );
1078 m1.setIdentifier( 5, "f" );
1079 m1.setIdentifier( 6, "g" );
1080 m1.setIdentifier( 7, "h" );
1081 m1.setIdentifier( 8, "i" );
1082 m1.setIdentifier( 9, "j" );
1083 m1.setIdentifier( 10, "k" );
1084 m1.setIdentifier( 11, "l" );
1085 m1.setIdentifier( 12, "m" );
1086 m1.setIdentifier( 13, "n" );
1087 m1.setIdentifier( 14, "o" );
1088 m1.setIdentifier( 15, "p" );
1089 m1.setIdentifier( 16, "q" );
1090 m1.setIdentifier( 17, "r" );
1091 m1.setCharacter( 0, "0" );
1092 m1.setState( "a", "0", "A" );
1093 m1.setState( "b", "0", "A" );
1094 m1.setState( "c", "0", "B" );
1095 m1.setState( "d", "0", "C" );
1096 m1.setState( "e", "0", "D" );
1097 m1.setState( "f", "0", "A" );
1098 m1.setState( "g", "0", "A" );
1099 m1.setState( "h", "0", "B" );
1100 m1.setState( "i", "0", "C" );
1101 m1.setState( "j", "0", "A" );
1102 m1.setState( "k", "0", "B" );
1103 m1.setState( "l", "0", "C" );
1104 m1.setState( "m", "0", "B" );
1105 m1.setState( "n", "0", "B" );
1106 m1.setState( "o", "0", "B" );
1107 m1.setState( "p", "0", "A" );
1108 m1.setState( "q", "0", "C" );
1109 m1.setState( "r", "0", "D" );
1110 fitch1.setReturnInternalStates( true );
1111 fitch1.setReturnGainLossMatrix( false );
1112 fitch1.setRandomize( false );
1113 fitch1.execute( p1, m1 );
1114 final CharacterStateMatrix<String> i_m = fitch1.getInternalStatesMatrix();
1115 final CharacterStateMatrix<List<String>> i_m_all = fitch1.getInternalStatesMatrixPriorToTraceback();
1116 if ( fitch1.getCost() != 10 ) {
1119 if ( !i_m.getState( "ab", "0" ).equals( "A" ) ) {
1122 if ( !i_m.getState( "ac", "0" ).equals( "A" ) ) {
1125 if ( !i_m.getState( "ad", "0" ).equals( "A" ) ) {
1128 if ( !i_m.getState( "ef", "0" ).equals( "A" ) ) {
1131 if ( !i_m.getState( "ai", "0" ).equals( "A" ) ) {
1134 if ( !i_m.getState( "gi", "0" ).equals( "A" ) ) {
1137 if ( !i_m.getState( "jl", "0" ).equals( "A" ) ) {
1140 if ( !i_m.getState( "mo", "0" ).equals( "B" ) ) {
1143 if ( !i_m.getState( "pr", "0" ).equals( "A" ) ) {
1146 if ( i_m_all.getState( "ab", "0" ).size() != 1 ) {
1149 if ( !i_m_all.getState( "ab", "0" ).contains( "A" ) ) {
1152 if ( i_m_all.getState( "ac", "0" ).size() != 2 ) {
1155 if ( !i_m_all.getState( "ac", "0" ).contains( "A" ) ) {
1158 if ( !i_m_all.getState( "ac", "0" ).contains( "B" ) ) {
1161 if ( i_m_all.getState( "ad", "0" ).size() != 3 ) {
1164 if ( !i_m_all.getState( "ad", "0" ).contains( "A" ) ) {
1167 if ( !i_m_all.getState( "ad", "0" ).contains( "B" ) ) {
1170 if ( !i_m_all.getState( "ad", "0" ).contains( "C" ) ) {
1173 if ( i_m_all.getState( "af", "0" ).size() != 1 ) {
1176 if ( !i_m_all.getState( "af", "0" ).contains( "A" ) ) {
1179 if ( i_m_all.getState( "ef", "0" ).size() != 2 ) {
1182 if ( !i_m_all.getState( "ef", "0" ).contains( "A" ) ) {
1185 if ( !i_m_all.getState( "ef", "0" ).contains( "D" ) ) {
1188 if ( i_m_all.getState( "gi", "0" ).size() != 3 ) {
1191 if ( !i_m_all.getState( "gi", "0" ).contains( "A" ) ) {
1194 if ( !i_m_all.getState( "gi", "0" ).contains( "B" ) ) {
1197 if ( !i_m_all.getState( "gi", "0" ).contains( "C" ) ) {
1200 if ( i_m_all.getState( "ai", "0" ).size() != 1 ) {
1203 if ( !i_m_all.getState( "ai", "0" ).contains( "A" ) ) {
1206 if ( i_m_all.getState( "jl", "0" ).size() != 3 ) {
1209 if ( !i_m_all.getState( "jl", "0" ).contains( "A" ) ) {
1212 if ( !i_m_all.getState( "jl", "0" ).contains( "B" ) ) {
1215 if ( !i_m_all.getState( "jl", "0" ).contains( "C" ) ) {
1218 if ( i_m_all.getState( "mo", "0" ).size() != 1 ) {
1221 if ( !i_m_all.getState( "mo", "0" ).contains( "B" ) ) {
1224 if ( i_m_all.getState( "pr", "0" ).size() != 3 ) {
1227 if ( !i_m_all.getState( "pr", "0" ).contains( "A" ) ) {
1230 if ( !i_m_all.getState( "pr", "0" ).contains( "C" ) ) {
1233 if ( !i_m_all.getState( "pr", "0" ).contains( "D" ) ) {
1236 if ( i_m_all.getState( "jr", "0" ).size() != 4 ) {
1239 if ( !i_m_all.getState( "jr", "0" ).contains( "A" ) ) {
1242 if ( !i_m_all.getState( "jr", "0" ).contains( "B" ) ) {
1245 if ( !i_m_all.getState( "jr", "0" ).contains( "C" ) ) {
1248 if ( !i_m_all.getState( "jr", "0" ).contains( "D" ) ) {
1251 final FitchParsimony<String> fitch2 = new FitchParsimony<String>();
1252 final PhylogenyFactory factory2 = ParserBasedPhylogenyFactory.getInstance();
1253 final String p2_str = "((a,b)ab,(c,(d,e)de)cde)r";
1254 final Phylogeny p2 = factory2.create( p2_str, new NHXParser() )[ 0 ];
1255 final CharacterStateMatrix<String> m2 = new BasicCharacterStateMatrix<String>( 5, 1 );
1256 m2.setIdentifier( 0, "a" );
1257 m2.setIdentifier( 1, "b" );
1258 m2.setIdentifier( 2, "c" );
1259 m2.setIdentifier( 3, "d" );
1260 m2.setIdentifier( 4, "e" );
1261 m2.setCharacter( 0, "0" );
1262 m2.setState( "a", "0", "C" );
1263 m2.setState( "b", "0", "A" );
1264 m2.setState( "c", "0", "C" );
1265 m2.setState( "d", "0", "A" );
1266 m2.setState( "e", "0", "G" );
1267 fitch2.setReturnInternalStates( true );
1268 fitch2.setReturnGainLossMatrix( false );
1269 fitch2.execute( p2, m2 );
1270 final CharacterStateMatrix<String> i_m2 = fitch2.getInternalStatesMatrix();
1271 final CharacterStateMatrix<List<String>> i_m_all2 = fitch2.getInternalStatesMatrixPriorToTraceback();
1272 if ( fitch2.getCost() != 3 ) {
1275 if ( !i_m2.getState( "ab", "0" ).equals( "A" ) ) {
1278 if ( !i_m2.getState( "de", "0" ).equals( "A" ) ) {
1281 if ( !i_m2.getState( "cde", "0" ).equals( "A" ) ) {
1284 if ( !i_m2.getState( "r", "0" ).equals( "A" ) ) {
1287 if ( i_m_all2.getState( "cde", "0" ).size() != 3 ) {
1290 if ( !i_m_all2.getState( "cde", "0" ).contains( "A" ) ) {
1293 if ( !i_m_all2.getState( "cde", "0" ).contains( "C" ) ) {
1296 if ( !i_m_all2.getState( "cde", "0" ).contains( "G" ) ) {
1299 if ( i_m_all2.getState( "ab", "0" ).size() != 2 ) {
1302 if ( !i_m_all2.getState( "ab", "0" ).contains( "A" ) ) {
1305 if ( !i_m_all2.getState( "ab", "0" ).contains( "C" ) ) {
1308 fitch2.setReturnInternalStates( true );
1309 fitch2.setReturnGainLossMatrix( false );
1310 fitch2.setUseLast( true );
1311 fitch2.execute( p2, m2 );
1312 final CharacterStateMatrix<String> i_m21 = fitch2.getInternalStatesMatrix();
1313 final CharacterStateMatrix<List<String>> i_m_all21 = fitch2.getInternalStatesMatrixPriorToTraceback();
1314 if ( fitch2.getCost() != 3 ) {
1317 if ( !i_m21.getState( "ab", "0" ).equals( "C" ) ) {
1320 if ( !i_m21.getState( "de", "0" ).equals( "G" ) ) {
1323 if ( !i_m21.getState( "cde", "0" ).equals( "C" ) ) {
1326 if ( !i_m21.getState( "r", "0" ).equals( "C" ) ) {
1329 if ( i_m_all21.getState( "cde", "0" ).size() != 3 ) {
1332 if ( !i_m_all21.getState( "cde", "0" ).contains( "A" ) ) {
1335 if ( !i_m_all21.getState( "cde", "0" ).contains( "C" ) ) {
1338 if ( !i_m_all21.getState( "cde", "0" ).contains( "G" ) ) {
1341 final FitchParsimony<String> fitch3 = new FitchParsimony<String>();
1342 final PhylogenyFactory factory3 = ParserBasedPhylogenyFactory.getInstance();
1343 final String p3_str = "(((a,b)ab,((c,d)cd,e)cde)abcde,f)r";
1344 final Phylogeny p3 = factory3.create( p3_str, new NHXParser() )[ 0 ];
1345 final CharacterStateMatrix<String> m3 = new BasicCharacterStateMatrix<String>( 6, 1 );
1346 m3.setIdentifier( 0, "a" );
1347 m3.setIdentifier( 1, "b" );
1348 m3.setIdentifier( 2, "c" );
1349 m3.setIdentifier( 3, "d" );
1350 m3.setIdentifier( 4, "e" );
1351 m3.setIdentifier( 5, "f" );
1352 m3.setCharacter( 0, "0" );
1353 m3.setState( "a", "0", "C" );
1354 m3.setState( "b", "0", "U" );
1355 m3.setState( "c", "0", "G" );
1356 m3.setState( "d", "0", "U" );
1357 m3.setState( "e", "0", "A" );
1358 m3.setState( "f", "0", "A" );
1359 fitch3.setReturnInternalStates( true );
1360 fitch3.setReturnGainLossMatrix( false );
1361 fitch3.execute( p3, m3 );
1362 final CharacterStateMatrix<String> i_m3 = fitch3.getInternalStatesMatrix();
1363 final CharacterStateMatrix<List<String>> i_m_all3 = fitch3.getInternalStatesMatrixPriorToTraceback();
1364 if ( fitch3.getCost() != 4 ) {
1367 if ( !i_m3.getState( "ab", "0" ).equals( "U" ) ) {
1370 if ( !i_m3.getState( "cd", "0" ).equals( "U" ) ) {
1373 if ( !i_m3.getState( "cde", "0" ).equals( "U" ) ) {
1376 if ( !i_m3.getState( "abcde", "0" ).equals( "U" ) ) {
1379 if ( !i_m3.getState( "r", "0" ).equals( "A" ) ) {
1382 if ( i_m_all3.getState( "cde", "0" ).size() != 3 ) {
1385 if ( !i_m_all3.getState( "cde", "0" ).contains( "A" ) ) {
1388 if ( !i_m_all3.getState( "cde", "0" ).contains( "G" ) ) {
1391 if ( !i_m_all3.getState( "cde", "0" ).contains( "U" ) ) {
1394 if ( i_m_all3.getState( "ab", "0" ).size() != 2 ) {
1397 if ( !i_m_all3.getState( "ab", "0" ).contains( "C" ) ) {
1400 if ( !i_m_all3.getState( "ab", "0" ).contains( "U" ) ) {
1403 if ( i_m_all3.getState( "cd", "0" ).size() != 2 ) {
1406 if ( !i_m_all3.getState( "cd", "0" ).contains( "G" ) ) {
1409 if ( !i_m_all3.getState( "cd", "0" ).contains( "U" ) ) {
1412 if ( i_m_all3.getState( "abcde", "0" ).size() != 1 ) {
1415 if ( !i_m_all3.getState( "abcde", "0" ).contains( "U" ) ) {
1418 if ( i_m_all3.getState( "r", "0" ).size() != 2 ) {
1421 if ( !i_m_all3.getState( "r", "0" ).contains( "A" ) ) {
1424 if ( !i_m_all3.getState( "r", "0" ).contains( "U" ) ) {
1427 final FitchParsimony<BinaryStates> fitch4 = new FitchParsimony<BinaryStates>();
1428 final PhylogenyFactory factory4 = ParserBasedPhylogenyFactory.getInstance();
1429 final String p4_str = "(((a,b)ab,((c,d)cd,e)cde)abcde,f)r";
1430 final Phylogeny p4 = factory4.create( p4_str, new NHXParser() )[ 0 ];
1431 final CharacterStateMatrix<BinaryStates> m4 = new BasicCharacterStateMatrix<BinaryStates>( 6, 1 );
1432 m4.setIdentifier( 0, "a" );
1433 m4.setIdentifier( 1, "b" );
1434 m4.setIdentifier( 2, "c" );
1435 m4.setIdentifier( 3, "d" );
1436 m4.setIdentifier( 4, "e" );
1437 m4.setIdentifier( 5, "f" );
1438 m4.setCharacter( 0, "0" );
1439 m4.setState( "a", "0", PRESENT );
1440 m4.setState( "b", "0", ABSENT );
1441 m4.setState( "c", "0", PRESENT );
1442 m4.setState( "d", "0", PRESENT );
1443 m4.setState( "e", "0", ABSENT );
1444 m4.setState( "f", "0", ABSENT );
1445 fitch4.setReturnInternalStates( true );
1446 fitch4.setReturnGainLossMatrix( true );
1447 fitch4.execute( p4, m4 );
1448 final CharacterStateMatrix<GainLossStates> gl_m_4 = fitch4.getGainLossMatrix();
1449 if ( fitch4.getCost() != 2 ) {
1452 if ( fitch4.getTotalLosses() != 0 ) {
1455 if ( fitch4.getTotalGains() != 2 ) {
1458 if ( fitch4.getTotalUnchanged() != 9 ) {
1461 if ( gl_m_4.getState( "a", "0" ) != GAIN ) {
1464 if ( gl_m_4.getState( "b", "0" ) != UNCHANGED_ABSENT ) {
1467 if ( gl_m_4.getState( "ab", "0" ) != UNCHANGED_ABSENT ) {
1470 if ( gl_m_4.getState( "cd", "0" ) != GAIN ) {
1473 if ( gl_m_4.getState( "r", "0" ) != UNCHANGED_ABSENT ) {
1476 final FitchParsimony<BinaryStates> fitch5 = new FitchParsimony<BinaryStates>();
1477 final PhylogenyFactory factory5 = ParserBasedPhylogenyFactory.getInstance();
1478 final String p5_str = "(((a,b)ab,((c,d)cd,e)cde)abcde,f)r";
1479 final Phylogeny p5 = factory5.create( p5_str, new NHXParser() )[ 0 ];
1480 final CharacterStateMatrix<BinaryStates> m5 = new BasicCharacterStateMatrix<BinaryStates>( 6, 1 );
1481 m5.setIdentifier( 0, "a" );
1482 m5.setIdentifier( 1, "b" );
1483 m5.setIdentifier( 2, "c" );
1484 m5.setIdentifier( 3, "d" );
1485 m5.setIdentifier( 4, "e" );
1486 m5.setIdentifier( 5, "f" );
1487 m5.setCharacter( 0, "0" );
1488 m5.setState( "a", "0", PRESENT );
1489 m5.setState( "b", "0", ABSENT );
1490 m5.setState( "c", "0", PRESENT );
1491 m5.setState( "d", "0", ABSENT );
1492 m5.setState( "e", "0", PRESENT );
1493 m5.setState( "f", "0", ABSENT );
1494 fitch5.setReturnInternalStates( true );
1495 fitch5.setReturnGainLossMatrix( true );
1496 fitch5.execute( p5, m5 );
1497 final CharacterStateMatrix<GainLossStates> gl_m_5 = fitch5.getGainLossMatrix();
1498 if ( fitch5.getCost() != 3 ) {
1501 if ( fitch5.getTotalLosses() != 2 ) {
1504 if ( fitch5.getTotalGains() != 1 ) {
1507 if ( fitch5.getTotalUnchanged() != 8 ) {
1510 if ( gl_m_5.getState( "abcde", "0" ) != GAIN ) {
1513 if ( gl_m_5.getState( "a", "0" ) != UNCHANGED_PRESENT ) {
1516 if ( gl_m_5.getState( "b", "0" ) != LOSS ) {
1519 if ( gl_m_5.getState( "d", "0" ) != LOSS ) {
1522 if ( gl_m_5.getState( "r", "0" ) != UNCHANGED_ABSENT ) {
1525 final FitchParsimony<BinaryStates> fitch6 = new FitchParsimony<BinaryStates>();
1526 final PhylogenyFactory factory6 = ParserBasedPhylogenyFactory.getInstance();
1527 final String p6_str = "(((a,b)ab,((c,d)cd,e)cde)abcde,f)r";
1528 final Phylogeny p6 = factory6.create( p6_str, new NHXParser() )[ 0 ];
1529 final CharacterStateMatrix<BinaryStates> m6 = new BasicCharacterStateMatrix<BinaryStates>( 6, 1 );
1530 m6.setIdentifier( 0, "a" );
1531 m6.setIdentifier( 1, "b" );
1532 m6.setIdentifier( 2, "c" );
1533 m6.setIdentifier( 3, "d" );
1534 m6.setIdentifier( 4, "e" );
1535 m6.setIdentifier( 5, "f" );
1536 m6.setCharacter( 0, "0" );
1537 m6.setState( "a", "0", PRESENT );
1538 m6.setState( "b", "0", ABSENT );
1539 m6.setState( "c", "0", PRESENT );
1540 m6.setState( "d", "0", PRESENT );
1541 m6.setState( "e", "0", ABSENT );
1542 m6.setState( "f", "0", PRESENT );
1543 fitch6.setReturnInternalStates( true );
1544 fitch6.setReturnGainLossMatrix( true );
1545 fitch6.execute( p6, m6 );
1546 final CharacterStateMatrix<GainLossStates> gl_m_6 = fitch6.getGainLossMatrix();
1547 if ( fitch6.getCost() != 2 ) {
1550 if ( fitch6.getTotalLosses() != 2 ) {
1553 if ( fitch6.getTotalGains() != 0 ) {
1556 if ( fitch6.getTotalUnchanged() != 9 ) {
1559 if ( gl_m_6.getState( "abcde", "0" ) != UNCHANGED_PRESENT ) {
1562 if ( gl_m_6.getState( "r", "0" ) != UNCHANGED_PRESENT ) {
1565 if ( gl_m_6.getState( "b", "0" ) != LOSS ) {
1568 if ( gl_m_6.getState( "e", "0" ) != LOSS ) {
1571 final FitchParsimony<BinaryStates> fitch7 = new FitchParsimony<BinaryStates>();
1572 final PhylogenyFactory factory7 = ParserBasedPhylogenyFactory.getInstance();
1573 final String p7_str = "(((a,b)ab,(c,d)cd)abcd,((e,f)ef,(g,h)gh)efgh)r";
1574 final Phylogeny p7 = factory7.create( p7_str, new NHXParser() )[ 0 ];
1575 final CharacterStateMatrix<BinaryStates> m7 = new BasicCharacterStateMatrix<BinaryStates>( 8, 1 );
1576 m7.setIdentifier( 0, "a" );
1577 m7.setIdentifier( 1, "b" );
1578 m7.setIdentifier( 2, "c" );
1579 m7.setIdentifier( 3, "d" );
1580 m7.setIdentifier( 4, "e" );
1581 m7.setIdentifier( 5, "f" );
1582 m7.setIdentifier( 6, "g" );
1583 m7.setIdentifier( 7, "h" );
1584 m7.setCharacter( 0, "0" );
1585 m7.setState( "a", "0", PRESENT );
1586 m7.setState( "b", "0", ABSENT );
1587 m7.setState( "c", "0", PRESENT );
1588 m7.setState( "d", "0", ABSENT );
1589 m7.setState( "e", "0", PRESENT );
1590 m7.setState( "f", "0", ABSENT );
1591 m7.setState( "g", "0", PRESENT );
1592 m7.setState( "h", "0", ABSENT );
1593 fitch7.setReturnInternalStates( true );
1594 fitch7.setReturnGainLossMatrix( true );
1595 fitch7.execute( p7, m7 );
1596 final CharacterStateMatrix<GainLossStates> gl_m_7 = fitch7.getGainLossMatrix();
1597 if ( fitch7.getCost() != 4 ) {
1600 if ( fitch7.getTotalLosses() != 0 ) {
1603 if ( fitch7.getTotalGains() != 4 ) {
1606 if ( fitch7.getTotalUnchanged() != 11 ) {
1609 if ( gl_m_7.getState( "a", "0" ) != GAIN ) {
1612 if ( gl_m_7.getState( "c", "0" ) != GAIN ) {
1615 if ( gl_m_7.getState( "e", "0" ) != GAIN ) {
1618 if ( gl_m_7.getState( "g", "0" ) != GAIN ) {
1621 if ( gl_m_7.getState( "r", "0" ) != UNCHANGED_ABSENT ) {
1624 fitch7.setReturnInternalStates( true );
1625 fitch7.setReturnGainLossMatrix( true );
1626 fitch7.setUseLast( true );
1627 fitch7.execute( p7, m7 );
1628 final CharacterStateMatrix<GainLossStates> gl_m_71 = fitch7.getGainLossMatrix();
1629 if ( fitch7.getCost() != 4 ) {
1632 if ( fitch7.getTotalLosses() != 4 ) {
1635 if ( fitch7.getTotalGains() != 0 ) {
1638 if ( fitch7.getTotalUnchanged() != 11 ) {
1641 if ( gl_m_71.getState( "b", "0" ) != LOSS ) {
1644 if ( gl_m_71.getState( "d", "0" ) != LOSS ) {
1647 if ( gl_m_71.getState( "f", "0" ) != LOSS ) {
1650 if ( gl_m_71.getState( "h", "0" ) != LOSS ) {
1653 if ( gl_m_71.getState( "r", "0" ) != UNCHANGED_PRESENT ) {
1656 final FitchParsimony<BinaryStates> fitch8 = new FitchParsimony<BinaryStates>();
1657 final PhylogenyFactory factory8 = ParserBasedPhylogenyFactory.getInstance();
1658 final String p8_str = "(((a,b)ab,(c,d)cd)abcd,((e,f)ef,(g,h)gh)efgh)r";
1659 final Phylogeny p8 = factory8.create( p8_str, new NHXParser() )[ 0 ];
1660 final CharacterStateMatrix<BinaryStates> m8 = new BasicCharacterStateMatrix<BinaryStates>( 8, 1 );
1661 m8.setIdentifier( 0, "a" );
1662 m8.setIdentifier( 1, "b" );
1663 m8.setIdentifier( 2, "c" );
1664 m8.setIdentifier( 3, "d" );
1665 m8.setIdentifier( 4, "e" );
1666 m8.setIdentifier( 5, "f" );
1667 m8.setIdentifier( 6, "g" );
1668 m8.setIdentifier( 7, "h" );
1669 m8.setCharacter( 0, "0" );
1670 m8.setState( "a", "0", PRESENT );
1671 m8.setState( "b", "0", PRESENT );
1672 m8.setState( "c", "0", PRESENT );
1673 m8.setState( "d", "0", ABSENT );
1674 m8.setState( "e", "0", ABSENT );
1675 m8.setState( "f", "0", ABSENT );
1676 m8.setState( "g", "0", ABSENT );
1677 m8.setState( "h", "0", ABSENT );
1678 fitch8.setReturnInternalStates( true );
1679 fitch8.setReturnGainLossMatrix( true );
1680 fitch8.execute( p8, m8 );
1681 final CharacterStateMatrix<GainLossStates> gl_m_8 = fitch8.getGainLossMatrix();
1682 if ( fitch8.getCost() != 2 ) {
1685 if ( fitch8.getTotalLosses() != 1 ) {
1688 if ( fitch8.getTotalGains() != 1 ) {
1691 if ( fitch8.getTotalUnchanged() != 13 ) {
1694 if ( gl_m_8.getState( "d", "0" ) != LOSS ) {
1697 if ( gl_m_8.getState( "abcd", "0" ) != GAIN ) {
1700 final FitchParsimony<BinaryStates> fitch9 = new FitchParsimony<BinaryStates>();
1701 final PhylogenyFactory factory9 = ParserBasedPhylogenyFactory.getInstance();
1702 final String p9_str = "(((a,b)ab,c)abc,d)abcd";
1703 final Phylogeny p9 = factory9.create( p9_str, new NHXParser() )[ 0 ];
1704 final CharacterStateMatrix<BinaryStates> m9 = new BasicCharacterStateMatrix<BinaryStates>( 4, 1 );
1705 m9.setIdentifier( 0, "a" );
1706 m9.setIdentifier( 1, "b" );
1707 m9.setIdentifier( 2, "c" );
1708 m9.setIdentifier( 3, "d" );
1709 m9.setCharacter( 0, "0" );
1710 m9.setState( "a", "0", PRESENT );
1711 m9.setState( "b", "0", ABSENT );
1712 m9.setState( "c", "0", PRESENT );
1713 m9.setState( "d", "0", ABSENT );
1714 fitch9.setReturnInternalStates( true );
1715 fitch9.setReturnGainLossMatrix( true );
1716 fitch9.setUseLast( false );
1717 fitch9.execute( p9, m9 );
1718 final CharacterStateMatrix<GainLossStates> gl_m_9a = fitch9.getGainLossMatrix();
1719 if ( fitch9.getCost() != 2 ) {
1722 if ( fitch9.getTotalLosses() != 1 ) {
1725 if ( fitch9.getTotalGains() != 1 ) {
1728 if ( fitch9.getTotalUnchanged() != 5 ) {
1731 if ( gl_m_9a.getState( "a", "0" ) != UNCHANGED_PRESENT ) {
1734 if ( gl_m_9a.getState( "b", "0" ) != LOSS ) {
1737 if ( gl_m_9a.getState( "c", "0" ) != UNCHANGED_PRESENT ) {
1740 if ( gl_m_9a.getState( "d", "0" ) != UNCHANGED_ABSENT ) {
1743 if ( gl_m_9a.getState( "ab", "0" ) != UNCHANGED_PRESENT ) {
1746 if ( gl_m_9a.getState( "abc", "0" ) != GAIN ) {
1749 if ( gl_m_9a.getState( "abcd", "0" ) != UNCHANGED_ABSENT ) {
1752 fitch9.setUseLast( true );
1753 fitch9.execute( p9, m9 );
1754 final CharacterStateMatrix<GainLossStates> gl_m_9b = fitch9.getGainLossMatrix();
1755 if ( fitch9.getCost() != 2 ) {
1758 if ( fitch9.getTotalLosses() != 2 ) {
1761 if ( fitch9.getTotalGains() != 0 ) {
1764 if ( fitch9.getTotalUnchanged() != 5 ) {
1767 if ( gl_m_9b.getState( "a", "0" ) != UNCHANGED_PRESENT ) {
1770 if ( gl_m_9b.getState( "b", "0" ) != LOSS ) {
1773 if ( gl_m_9b.getState( "c", "0" ) != UNCHANGED_PRESENT ) {
1776 if ( gl_m_9b.getState( "d", "0" ) != LOSS ) {
1779 if ( gl_m_9b.getState( "ab", "0" ) != UNCHANGED_PRESENT ) {
1782 if ( gl_m_9b.getState( "abc", "0" ) != UNCHANGED_PRESENT ) {
1785 if ( gl_m_9b.getState( "abcd", "0" ) != UNCHANGED_PRESENT ) {
1788 fitch9.setUseLast( false );
1789 fitch9.setRandomize( true );
1790 fitch9.setRandomNumberSeed( 8722445 );
1791 fitch9.execute( p9, m9 );
1792 fitch9.getGainLossMatrix();
1793 if ( fitch9.getCost() != 2 ) {
1796 if ( fitch9.getTotalLosses() != 1 ) {
1799 if ( fitch9.getTotalGains() != 1 ) {
1802 if ( fitch9.getTotalUnchanged() != 5 ) {
1805 final FitchParsimony<BinaryStates> fitch10 = new FitchParsimony<BinaryStates>();
1806 final PhylogenyFactory factory10 = ParserBasedPhylogenyFactory.getInstance();
1807 final String p10_str = "((((a,b)ab,c)abc,d)abcd,e)abcde";
1808 final Phylogeny p10 = factory10.create( p10_str, new NHXParser() )[ 0 ];
1809 final CharacterStateMatrix<BinaryStates> m10 = new BasicCharacterStateMatrix<BinaryStates>( 5, 1 );
1810 m10.setIdentifier( 0, "a" );
1811 m10.setIdentifier( 1, "b" );
1812 m10.setIdentifier( 2, "c" );
1813 m10.setIdentifier( 3, "d" );
1814 m10.setIdentifier( 4, "e" );
1815 m10.setCharacter( 0, "0" );
1816 m10.setState( "a", "0", PRESENT );
1817 m10.setState( "b", "0", ABSENT );
1818 m10.setState( "c", "0", ABSENT );
1819 m10.setState( "d", "0", PRESENT );
1820 m10.setState( "e", "0", ABSENT );
1821 fitch10.setReturnInternalStates( true );
1822 fitch10.setReturnGainLossMatrix( true );
1823 fitch10.setUseLast( false );
1824 fitch10.execute( p10, m10 );
1825 final CharacterStateMatrix<GainLossStates> gl_m_10a = fitch10.getGainLossMatrix();
1826 if ( fitch10.getCost() != 2 ) {
1829 if ( fitch10.getTotalLosses() != 0 ) {
1832 if ( fitch10.getTotalGains() != 2 ) {
1835 if ( fitch10.getTotalUnchanged() != 7 ) {
1838 if ( gl_m_10a.getState( "a", "0" ) != GAIN ) {
1841 if ( gl_m_10a.getState( "b", "0" ) != UNCHANGED_ABSENT ) {
1844 if ( gl_m_10a.getState( "c", "0" ) != UNCHANGED_ABSENT ) {
1847 if ( gl_m_10a.getState( "d", "0" ) != GAIN ) {
1850 if ( gl_m_10a.getState( "e", "0" ) != UNCHANGED_ABSENT ) {
1853 if ( gl_m_10a.getState( "ab", "0" ) != UNCHANGED_ABSENT ) {
1856 if ( gl_m_10a.getState( "abc", "0" ) != UNCHANGED_ABSENT ) {
1859 if ( gl_m_10a.getState( "abcd", "0" ) != UNCHANGED_ABSENT ) {
1862 if ( gl_m_10a.getState( "abcde", "0" ) != UNCHANGED_ABSENT ) {
1865 fitch10.setUseLast( true );
1866 fitch10.execute( p10, m10 );
1867 final CharacterStateMatrix<GainLossStates> gl_m_10b = fitch10.getGainLossMatrix();
1868 if ( fitch10.getCost() != 2 ) {
1871 if ( fitch10.getTotalLosses() != 0 ) {
1874 if ( fitch10.getTotalGains() != 2 ) {
1877 if ( fitch10.getTotalUnchanged() != 7 ) {
1880 if ( gl_m_10b.getState( "a", "0" ) != GAIN ) {
1883 if ( gl_m_10b.getState( "b", "0" ) != UNCHANGED_ABSENT ) {
1886 if ( gl_m_10b.getState( "c", "0" ) != UNCHANGED_ABSENT ) {
1889 if ( gl_m_10b.getState( "d", "0" ) != GAIN ) {
1892 if ( gl_m_10b.getState( "e", "0" ) != UNCHANGED_ABSENT ) {
1895 if ( gl_m_10b.getState( "ab", "0" ) != UNCHANGED_ABSENT ) {
1898 if ( gl_m_10b.getState( "abc", "0" ) != UNCHANGED_ABSENT ) {
1901 if ( gl_m_10b.getState( "abcd", "0" ) != UNCHANGED_ABSENT ) {
1904 if ( gl_m_10b.getState( "abcde", "0" ) != UNCHANGED_ABSENT ) {
1908 catch ( final Exception e ) {
1909 e.printStackTrace( System.out );
1915 private static boolean testNeighborJoining() {
1917 final NeighborJoining nj = NeighborJoining.createInstance();
1918 // BasicSymmetricalDistanceMatrix m0 = new BasicSymmetricalDistanceMatrix( 4 );
1919 // m0.setIdentifier( 0, "A" );
1920 // m0.setIdentifier( 1, "B" );
1921 // m0.setIdentifier( 2, "C" );
1922 // m0.setIdentifier( 3, "D" );
1923 // m0.setRow( "5 ", 1 );
1924 // m0.setRow( "3 6 ", 2 );
1925 // m0.setRow( "7.5 10.5 5.5", 3 );
1926 // System.out.println( m0.toString() );
1927 // final Phylogeny p0 = nj.execute( m0 );
1928 // Archaeopteryx.createApplication( p0 );
1930 BasicSymmetricalDistanceMatrix m = new BasicSymmetricalDistanceMatrix( 6 );
1932 m.setRow( "4 7", 2 );
1933 m.setRow( "7 10 7", 3 );
1934 m.setRow( "6 9 6 5", 4 );
1935 m.setRow( "8 11 8 9 8", 5 );
1936 m.setIdentifier( 0, "A" );
1937 m.setIdentifier( 1, "B" );
1938 m.setIdentifier( 2, "C" );
1939 m.setIdentifier( 3, "D" );
1940 m.setIdentifier( 4, "E" );
1941 m.setIdentifier( 5, "F" );
1942 System.out.println( m.toString() );
1943 final Phylogeny p1 = nj.execute( m );
1944 Archaeopteryx.createApplication( p1 );
1945 // m = new BasicSymmetricalDistanceMatrix( 7 );
1946 // m.setIdentifier( 0, "Bovine" );
1947 // m.setIdentifier( 1, "Mouse" );
1948 // m.setIdentifier( 2, "Gibbon" );
1949 // m.setIdentifier( 3, "Orang" );
1950 // m.setIdentifier( 4, "Gorilla" );
1951 // m.setIdentifier( 5, "Chimp" );
1952 // m.setIdentifier( 6, "Human" );
1953 // m.setRow( "0.00000 1.68660 1.71980 1.66060 1.52430 1.60430 1.59050", 0 );
1954 // m.setRow( "1.68660 0.00000 1.52320 1.48410 1.44650 1.43890 1.46290", 1 );
1955 // m.setRow( "1.71980 1.52320 0.00000 0.71150 0.59580 0.61790 0.55830", 2 );
1956 // m.setRow( "1.66060 1.48410 0.71150 0.00000 0.46310 0.50610 0.47100", 3 );
1957 // m.setRow( "1.52430 1.44650 0.59580 0.46310 0.00000 0.34840 0.30830", 4 );
1958 // m.setRow( "1.60430 1.43890 0.61790 0.50610 0.34840 0.00000 0.26920", 5 );
1959 // m.setRow( "1.59050 1.46290 0.55830 0.47100 0.30830 0.26920 0.00000", 6 );
1960 // System.out.println( m.toString() );
1961 // final Phylogeny p2 = nj.execute( m );
1962 // p2.reRoot( p2.getNode( "Bovine" ) );
1963 // System.out.println( p2.toString() );
1964 // Archaeopteryx.createApplication( p2 );
1965 // // from phylip Neighbor-Joining/UPGMA method version 3.69:
1966 // // ((((((Chimp:0.15167,Human:0.11753):0.03982,Gorilla:0.15393):0.02696,Orang:0.28469):0.04648,Gibbon:0.35793):0.42027,Mouse:0.76891):0.458845,Bovine:0.458845);
1967 // Archaeopteryx.createApplication( p2 );
1968 // m = new BasicSymmetricalDistanceMatrix( 4 );
1969 // m.setIdentifier( 0, "A" );
1970 // m.setIdentifier( 1, "B" );
1971 // m.setIdentifier( 2, "C" );
1972 // m.setIdentifier( 3, "D" );
1973 // m.setRow( "0.00 0.95 0.17 0.98", 0 );
1974 // m.setRow( "0.95 0.00 1.02 1.83", 1 );
1975 // m.setRow( "0.17 1.02 0.00 1.01", 2 );
1976 // m.setRow( "0.98 1.83 1.01 0.00", 3 );
1977 // final Phylogeny p3 = nj.execute( m );
1981 // // ----------------------- B 0.90
1985 // // ------------------------- D 0.91
1986 // p3.reRoot( p3.getNode( "C" ).getParent() );
1987 // if ( !isEqual( p3.getNode( "A" ).getDistanceToParent(), 0.05 ) ) {
1990 // if ( !isEqual( p3.getNode( "B" ).getDistanceToParent(), 0.90 ) ) {
1993 // if ( !isEqual( p3.getNode( "C" ).getDistanceToParent(), 0.10 ) ) {
1996 // if ( !isEqual( p3.getNode( "D" ).getDistanceToParent(), 0.91 ) ) {
2000 // timeNeighborJoining();
2003 catch ( final Exception e ) {
2004 e.printStackTrace( System.out );
2010 private static boolean testSymmetricalDistanceMatrixParser() {
2012 final String l = ForesterUtil.getLineSeparator();
2013 StringBuffer source = new StringBuffer();
2014 source.append( " 4" + l );
2015 source.append( "A 0 0 0 0" + l );
2016 source.append( "B 1 0 0 0" + l );
2017 source.append( "C 2 4 0 0" + l );
2018 source.append( "D 3 5 6 0" + l );
2020 source.append( " 4" + l );
2021 source.append( "A 0 11 12 13" + l );
2022 source.append( "B 11 0 14 15" + l );
2023 source.append( "C 12 14 0 16" + l );
2024 source.append( "D 13 15 16 0" + l );
2027 source.append( " " + l );
2028 source.append( " 4" + l );
2029 source.append( " A 0 " + l );
2030 source.append( " B 21 0" + l );
2031 source.append( " C 22 24 0 " + l );
2032 source.append( " # 2 222 2 2 " + l );
2033 source.append( " D 23 25 26 0" + l );
2036 source.append( " " + l );
2037 final SymmetricalDistanceMatrixParser p0 = SymmetricalDistanceMatrixParser.createInstance();
2038 final DistanceMatrix[] ma0 = p0.parse( source.toString() );
2039 if ( ma0.length != 3 ) {
2042 if ( !isEqual( ma0[ 0 ].getValue( 0, 0 ), 0 ) ) {
2045 if ( !isEqual( ma0[ 0 ].getValue( 1, 0 ), 1 ) ) {
2048 if ( !isEqual( ma0[ 0 ].getValue( 2, 0 ), 2 ) ) {
2051 if ( !isEqual( ma0[ 0 ].getValue( 3, 0 ), 3 ) ) {
2054 if ( !isEqual( ma0[ 0 ].getValue( 0, 1 ), 1 ) ) {
2057 if ( !isEqual( ma0[ 0 ].getValue( 1, 1 ), 0 ) ) {
2060 if ( !isEqual( ma0[ 0 ].getValue( 2, 1 ), 4 ) ) {
2063 if ( !isEqual( ma0[ 0 ].getValue( 3, 1 ), 5 ) ) {
2066 if ( !isEqual( ma0[ 1 ].getValue( 0, 0 ), 0 ) ) {
2069 if ( !isEqual( ma0[ 1 ].getValue( 1, 0 ), 11 ) ) {
2072 if ( !isEqual( ma0[ 1 ].getValue( 2, 0 ), 12 ) ) {
2075 if ( !isEqual( ma0[ 1 ].getValue( 3, 0 ), 13 ) ) {
2078 if ( !isEqual( ma0[ 1 ].getValue( 0, 1 ), 11 ) ) {
2081 if ( !isEqual( ma0[ 1 ].getValue( 1, 1 ), 0 ) ) {
2084 if ( !isEqual( ma0[ 1 ].getValue( 2, 1 ), 14 ) ) {
2087 if ( !isEqual( ma0[ 1 ].getValue( 3, 1 ), 15 ) ) {
2090 if ( !isEqual( ma0[ 2 ].getValue( 0, 0 ), 0 ) ) {
2093 if ( !isEqual( ma0[ 2 ].getValue( 1, 0 ), 21 ) ) {
2096 if ( !isEqual( ma0[ 2 ].getValue( 2, 0 ), 22 ) ) {
2099 if ( !isEqual( ma0[ 2 ].getValue( 3, 0 ), 23 ) ) {
2102 if ( !isEqual( ma0[ 2 ].getValue( 0, 1 ), 21 ) ) {
2105 if ( !isEqual( ma0[ 2 ].getValue( 1, 1 ), 0 ) ) {
2108 if ( !isEqual( ma0[ 2 ].getValue( 2, 1 ), 24 ) ) {
2111 if ( !isEqual( ma0[ 2 ].getValue( 3, 1 ), 25 ) ) {
2114 source = new StringBuffer();
2115 source.append( "A 0 0 0 0" + l );
2116 source.append( "B 1 0 0 0" + l );
2117 source.append( "C 2 4 0 0" + l );
2118 source.append( "D 3 5 6 0" + l );
2119 source.append( " " + l );
2120 source.append( "A 0 11 12 13" + l );
2121 source.append( "B 11 0 14 15" + l );
2122 source.append( "C 12 14 0 16" + l );
2123 source.append( "D 13 15 16 0" + l );
2125 source.append( " A 0 " + l );
2126 source.append( " B 21 0" + l );
2127 source.append( " C 22 24 0 " + l );
2128 source.append( " # 2 222 2 2 " + l );
2129 source.append( " D 23 25 26 0" + l );
2130 final DistanceMatrix[] ma1 = p0.parse( source.toString() );
2131 if ( ma1.length != 3 ) {
2134 if ( !isEqual( ma1[ 0 ].getValue( 0, 0 ), 0 ) ) {
2137 if ( !isEqual( ma1[ 0 ].getValue( 1, 0 ), 1 ) ) {
2140 if ( !isEqual( ma1[ 0 ].getValue( 2, 0 ), 2 ) ) {
2143 if ( !isEqual( ma1[ 0 ].getValue( 3, 0 ), 3 ) ) {
2146 if ( !isEqual( ma1[ 0 ].getValue( 0, 1 ), 1 ) ) {
2149 if ( !isEqual( ma1[ 0 ].getValue( 1, 1 ), 0 ) ) {
2152 if ( !isEqual( ma1[ 0 ].getValue( 2, 1 ), 4 ) ) {
2155 if ( !isEqual( ma1[ 0 ].getValue( 3, 1 ), 5 ) ) {
2158 if ( !isEqual( ma1[ 1 ].getValue( 0, 0 ), 0 ) ) {
2161 if ( !isEqual( ma1[ 1 ].getValue( 1, 0 ), 11 ) ) {
2164 if ( !isEqual( ma1[ 1 ].getValue( 2, 0 ), 12 ) ) {
2167 if ( !isEqual( ma1[ 1 ].getValue( 3, 0 ), 13 ) ) {
2170 if ( !isEqual( ma1[ 1 ].getValue( 0, 1 ), 11 ) ) {
2173 if ( !isEqual( ma1[ 1 ].getValue( 1, 1 ), 0 ) ) {
2176 if ( !isEqual( ma1[ 1 ].getValue( 2, 1 ), 14 ) ) {
2179 if ( !isEqual( ma1[ 1 ].getValue( 3, 1 ), 15 ) ) {
2182 if ( !isEqual( ma1[ 2 ].getValue( 0, 0 ), 0 ) ) {
2185 if ( !isEqual( ma1[ 2 ].getValue( 1, 0 ), 21 ) ) {
2188 if ( !isEqual( ma1[ 2 ].getValue( 2, 0 ), 22 ) ) {
2191 if ( !isEqual( ma1[ 2 ].getValue( 3, 0 ), 23 ) ) {
2194 if ( !isEqual( ma1[ 2 ].getValue( 0, 1 ), 21 ) ) {
2197 if ( !isEqual( ma1[ 2 ].getValue( 1, 1 ), 0 ) ) {
2200 if ( !isEqual( ma1[ 2 ].getValue( 2, 1 ), 24 ) ) {
2203 if ( !isEqual( ma1[ 2 ].getValue( 3, 1 ), 25 ) ) {
2206 source = new StringBuffer();
2207 source.append( "A 0" + l );
2208 source.append( "B 10 0" + l );
2209 final DistanceMatrix[] ma2 = p0.parse( source.toString() );
2210 if ( ma2.length != 1 ) {
2213 if ( !isEqual( ma2[ 0 ].getValue( 0, 1 ), 10 ) ) {
2216 source = new StringBuffer();
2217 source.append( " " + l );
2218 source.append( "#" + l );
2219 final DistanceMatrix[] ma3 = p0.parse( source.toString() );
2220 if ( ma3.length != 0 ) {
2223 source = new StringBuffer();
2224 source.append( " " + l );
2225 source.append( "A 0 11 12 13" + l );
2226 source.append( "B 0 14 15" + l );
2227 source.append( "C 0 16" + l );
2228 source.append( "D 0" + l );
2230 source.append( "A 0 21 22 23" + l );
2231 source.append( "B 0 24 25" + l );
2232 source.append( "C 0 26" + l );
2233 source.append( "D 0" + l );
2234 p0.setInputMatrixType( SymmetricalDistanceMatrixParser.InputMatrixType.UPPER_TRIANGLE );
2235 final DistanceMatrix[] ma4 = p0.parse( source );
2236 if ( ma4.length != 2 ) {
2239 if ( !isEqual( ma4[ 0 ].getValue( 0, 0 ), 0 ) ) {
2242 if ( !isEqual( ma4[ 0 ].getValue( 1, 0 ), 11 ) ) {
2245 if ( !isEqual( ma4[ 0 ].getValue( 2, 0 ), 12 ) ) {
2248 if ( !isEqual( ma4[ 0 ].getValue( 3, 0 ), 13 ) ) {
2251 if ( !isEqual( ma4[ 0 ].getValue( 0, 1 ), 11 ) ) {
2254 if ( !isEqual( ma4[ 0 ].getValue( 1, 1 ), 0 ) ) {
2257 if ( !isEqual( ma4[ 0 ].getValue( 2, 1 ), 14 ) ) {
2260 if ( !isEqual( ma4[ 0 ].getValue( 3, 1 ), 15 ) ) {
2263 if ( !isEqual( ma4[ 0 ].getValue( 0, 2 ), 12 ) ) {
2266 if ( !isEqual( ma4[ 0 ].getValue( 1, 2 ), 14 ) ) {
2269 if ( !isEqual( ma4[ 0 ].getValue( 2, 2 ), 0 ) ) {
2272 if ( !isEqual( ma4[ 0 ].getValue( 3, 2 ), 16 ) ) {
2275 if ( !isEqual( ma4[ 0 ].getValue( 0, 3 ), 13 ) ) {
2278 if ( !isEqual( ma4[ 0 ].getValue( 1, 3 ), 15 ) ) {
2281 if ( !isEqual( ma4[ 0 ].getValue( 2, 3 ), 16 ) ) {
2284 if ( !isEqual( ma4[ 0 ].getValue( 3, 3 ), 0 ) ) {
2287 source = new StringBuffer();
2288 source.append( " 4 " + l );
2289 source.append( "A 0 11 12 13" + l );
2290 source.append( "B 0 14 15" + l );
2291 source.append( "C 0 16" + l );
2292 source.append( "D 0" + l );
2293 source.append( " 4" + l );
2294 source.append( "A 0 21 22 23" + l );
2295 source.append( "B 0 24 25" + l );
2296 source.append( "C 0 26" + l );
2297 source.append( "D 0" + l );
2298 source.append( " " + l );
2299 source.append( " 4" + l );
2300 source.append( "A 0 21 22 23" + l );
2301 source.append( "B 0 24 25" + l );
2302 source.append( "C 0 26" + l );
2303 source.append( "D 0" + l );
2305 source.append( "A 0 21 22 23" + l );
2306 source.append( "B 0 24 25" + l );
2307 source.append( "C 0 26" + l );
2308 source.append( "D 0" + l );
2309 p0.setInputMatrixType( SymmetricalDistanceMatrixParser.InputMatrixType.UPPER_TRIANGLE );
2310 final DistanceMatrix[] ma5 = p0.parse( source );
2311 if ( ma5.length != 4 ) {
2314 if ( !isEqual( ma5[ 0 ].getValue( 0, 0 ), 0 ) ) {
2317 if ( !isEqual( ma5[ 0 ].getValue( 1, 0 ), 11 ) ) {
2320 if ( !isEqual( ma5[ 0 ].getValue( 2, 0 ), 12 ) ) {
2323 if ( !isEqual( ma5[ 0 ].getValue( 3, 0 ), 13 ) ) {
2326 if ( !isEqual( ma5[ 0 ].getValue( 0, 1 ), 11 ) ) {
2329 if ( !isEqual( ma5[ 0 ].getValue( 1, 1 ), 0 ) ) {
2332 if ( !isEqual( ma5[ 0 ].getValue( 2, 1 ), 14 ) ) {
2335 if ( !isEqual( ma5[ 0 ].getValue( 3, 1 ), 15 ) ) {
2338 if ( !isEqual( ma5[ 0 ].getValue( 0, 2 ), 12 ) ) {
2341 if ( !isEqual( ma5[ 0 ].getValue( 1, 2 ), 14 ) ) {
2344 if ( !isEqual( ma5[ 0 ].getValue( 2, 2 ), 0 ) ) {
2347 if ( !isEqual( ma5[ 0 ].getValue( 3, 2 ), 16 ) ) {
2350 if ( !isEqual( ma5[ 0 ].getValue( 0, 3 ), 13 ) ) {
2353 if ( !isEqual( ma5[ 0 ].getValue( 1, 3 ), 15 ) ) {
2356 if ( !isEqual( ma5[ 0 ].getValue( 2, 3 ), 16 ) ) {
2359 if ( !isEqual( ma5[ 0 ].getValue( 3, 3 ), 0 ) ) {
2363 catch ( final Exception e ) {
2364 e.printStackTrace( System.out );
2370 private static void timeNeighborJoining() {
2371 final NeighborJoining nj = NeighborJoining.createInstance();
2372 for( int n = 3; n <= 6; ++n ) {
2373 final int x = ( int ) Math.pow( 2, n );
2374 final BasicSymmetricalDistanceMatrix mt = new BasicSymmetricalDistanceMatrix( x );
2375 mt.randomize( new Date().getTime() );
2376 // for( int i = 0; i < mt.getSize(); i++ ) {
2377 // mt.setIdentifier( i, i + "i" );
2379 // System.out.println( mt.toStringBuffer( Format.PHYLIP ) );
2380 final long start_time = new Date().getTime();
2382 System.out.println( "Size: " + x + " -> " + ( new Date().getTime() - start_time ) + "ms." );