#NEXUS 

Begin trees;  [Treefile saved Fri Dec 22 14:16:34 2000]
[!
>Data file = C:\My Documents\PAUP NEXUS files\CarlsonVertebrates.nex
>Heuristic search settings:
>   Optimality criterion = maximum parsimony
>      Character-status summary:
>        Of 14 total characters:
>          All characters are of type 'unord'
>          All characters have equal weight
>          1 character is constant
>          1 variable character is parsimony-uninformative
>          Number of parsimony-informative characters = 12
>      Gaps are treated as "missing"
>   Starting tree(s) obtained via stepwise addition
>   Addition sequence: simple (reference taxon = shark)
>   Number of trees held at each step during stepwise addition = 1
>   Branch-swapping algorithm: tree-bisection-reconnection (TBR)
>   Steepest descent option not in effect
>   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
>
>Heuristic search completed
>   Total number of rearrangements tried = 1108
>   Score of best tree(s) found = 16
>   Number of trees retained = 4
>   Time used = 0.00 sec
]
	Translate
		1 shark,
		2 tuna,
		3 frog,
		4 Dimetrodon,
		5 human,
		6 whale,
		7 crocodile,
		8 Saurischian,
		9 bird,
		10 Ornithiscian
		;
tree PAUP_1 = [&U] (1,(2,(3,((4,5,6),(7,((8,9),10))))));
tree PAUP_2 = [&U] (1,(2,(3,((4,(5,6)),(7,((8,9),10))))));
tree PAUP_3 = [&U] (1,(2,(3,(4,(5,6),(7,((8,9),10))))));
tree PAUP_4 = [&U] (1,(2,(3,(4,((5,6),(7,((8,9),10)))))));
End;