#NEXUS ^M^MBegin trees;  [Treefile saved Wed Apr 12 10:05:54 2006]^M[!^M>Data file = /Users/mholder/Documents/projects/CIPRES_workspace/cipres/framework/python/test/files/12Tx432C.nex^M>Heuristic search settings:^M>  Optimality criterion = parsimony^M>    Character-status summary:^M>      Of 432 total characters:^M>        All characters are of type 'unord'^M>        All characters have equal weight^M>        259 characters are constant
>        54 variable characters are parsimony-uninformative
>        Number of parsimony-informative characters = 119
>  Starting tree(s) obtained via stepwise addition
>  Addition sequence: simple (reference taxon = a)
>  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 = 4963
>   Score of best tree(s) found = 331
>   Number of trees retained = 9
>   Time used = <1 sec (CPU time = 0.00 sec)
]
	Translate
		1 a,
		2 b,
		3 c,
		4 d,
		5 e,
		6 f,
		7 g,
		8 u,
		9 v,
		10 x,
		11 y,
		12 t
		;
tree PAUP_1 = [&U] (1,((2,(3,(4,(10,5)))),(((6,7),8),(9,(11,12)))));
End;