// ConvexMPDist.jj Version 1.0, 10th August 2015, by Steven Kelk // Note: this program reads its input from the standard input, not from a file, so if the program // seems to have hung then that is probably the reason. Taxa: 30 Starting search... New best distance so far: 0 New best distance so far: 1 New best distance so far: 2 New best distance so far: 3 New best distance so far: 4 New best distance so far: 5 New best distance so far: 6 New best distance so far: 7 New best distance so far: 8 New best distance so far: 9 New best distance so far: 10 New best distance so far: 11 New best distance so far: 12 New best distance so far: 13 New best distance so far: 14 New best distance so far: 15 New best distance so far: 16 New best distance so far: 17 New best distance so far: 18 Total valid characters from tree 1 is: 514229 Lower bound on c in c^n from this tree is thus: 1.5501434355027885 Total valid characters from tree 2 is: 514229 Lower bound on c in c^n from this tree is thus: 1.5501434355027885 Finished. Time elapsed during search (on 30 taxa): 51 seconds. Outputting an optimal character: Taxon 9 has state 0 Taxon 7 has state 0 Taxon 20 has state 1 Taxon 18 has state 1 Taxon 8 has state 1 Taxon 14 has state 1 Taxon 24 has state 1 Taxon 0 has state 1 Taxon 15 has state 0 Taxon 1 has state 0 Taxon 19 has state 2 Taxon 10 has state 2 Taxon 23 has state 2 Taxon 13 has state 0 Taxon 2 has state 0 Taxon 5 has state 3 Taxon 6 has state 3 Taxon 4 has state 4 Taxon 27 has state 4 Taxon 11 has state 4 Taxon 12 has state 4 Taxon 21 has state 4 Taxon 17 has state 4 Taxon 26 has state 5 Taxon 29 has state 5 Taxon 22 has state 5 Taxon 28 has state 5 Taxon 3 has state 3 Taxon 25 has state 3 Taxon 16 has state 3 OPTIMUM = 18