#NEXUS 

Begin trees;  [Treefile saved Tue Nov 09 14:52:38 2010]
[!
>Data file = C:\Users\Julius Office\Desktop\Juliusetal2006.nex
>Branch-and-bound search settings:
>  Optimality criterion = parsimony
>    Character-status summary:
>      Of 24 total characters:
>        All characters are of type 'unord'
>        All characters have equal weight
>        1 character is constant
>        10 variable characters are parsimony-uninformative
>        Number of parsimony-informative characters = 13
>    Gaps are treated as "missing"
>  Initial upper bound: unknown (compute heuristically)
>  Addition sequence: furthest
>  Initial 'MaxTrees' setting = 100
>  Branches collapsed (creating polytomies) if maximum branch length is zero
>  'MulTrees' option in effect
>  Topological constraints not enforced
>  Trees are unrooted
>
>Branch-and-bound search completed:
>   Score of best tree found = 40
>   Number of trees retained = 3
>   Time used = 0.00 sec
]
	Translate
		1 Stephanodiscus_hantzschii,
		2 Stephanodiscus_minutus,
		3 Stephanodiscus_vestibulis,
		4 Stephanodiscus_carconensis,
		5 'Stephanodiscus subtransilvanicus (African Fossil)',
		6 'Stephanodiscus subtransilvanicus (Laurentian Great Lakes)',
		7 Stephanodiscus_agassizensis,
		8 Stephanodiscus_alpinus,
		9 Stephanodiscus_neoastraea,
		10 Stephanodiscus_galileensis,
		11 Stephanodsicus_rotula,
		12 Stephanodiscus_niagarae,
		13 Stephanodiscus_reimerii,
		14 Stephanodiscus_yellowstonensis,
		15 Stephanodiscus_superiorensis,
		16 Stephanodiscus_kusuensis
		;
tree PAUP_1 = [&U] (1,((2,3),(((4,6),5),((7,8),(9,(10,(11,((12,13,14,15),16))))))));
tree PAUP_2 = [&U] (1,((2,3),(((4,6),5),((7,8),(9,(10,(11,(((12,13,14),15),16))))))));
tree PAUP_3 = [&U] (1,((2,3),(((4,6),5),((7,8),(9,(10,(11,((12,13,14),15,16))))))));
End;