#nexus begin trees; tree sptree = (PGI,(OGI,(ST,(AGI,(GM,(MT,LJ)))))); end; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl10336.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 987 total characters: > All characters are of type 'unord' > All characters have equal weight > 742 characters are constant > 202 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 43 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225292 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 274 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl10531.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 943 total characters: > All characters are of type 'unord' > All characters have equal weight > 658 characters are constant > 172 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 113 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216096 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 378 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl10639.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 935 total characters: > All characters are of type 'unord' > All characters have equal weight > 667 characters are constant > 209 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 59 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216762 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 318 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,MT),(LJ,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl10641.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 890 total characters: > All characters are of type 'unord' > All characters have equal weight > 434 characters are constant > 70 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 386 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC270679 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2172 > Score of best tree(s) found = 1395 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),((ST,ST),ST)),(((((LJ,GM),MT),(GM,GM)),LJ),MT)),((OGI,OGI),OGI)):0.5000; tree PAUP_2 = [&R] ((((AGI,AGI),((ST,ST),ST)),(((((LJ,GM),MT),MT),(GM,GM)),LJ)),((OGI,OGI),OGI)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl10649.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 583 total characters: > All characters are of type 'unord' > All characters have equal weight > 337 characters are constant > 98 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 148 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251587 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 114 > Score of best tree(s) found = 361 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),((AGI,GM),AGI)),(GM,(LJ,MT))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl10702.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 696 total characters: > All characters are of type 'unord' > All characters have equal weight > 413 characters are constant > 70 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 213 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC94213 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 128 > Score of best tree(s) found = 397 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((MT,MT),(GM,GM)),LJ),(ST,ST)):0.5000; tree PAUP_2 = [&R] (((MT,MT),((GM,GM),LJ)),(ST,ST)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl10838.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1262 total characters: > All characters are of type 'unord' > All characters have equal weight > 778 characters are constant > 329 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 155 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226367 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 69 > Score of best tree(s) found = 715 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,((MT,MT),GM)),ST),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11019.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1078 total characters: > All characters are of type 'unord' > All characters have equal weight > 642 characters are constant > 227 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 209 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216709 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 711 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),LJ),MT),(GM,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11038.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 735 total characters: > All characters are of type 'unord' > All characters have equal weight > 389 characters are constant > 163 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 183 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252395 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 78 > Score of best tree(s) found = 615 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,(LJ,(MT,GM))),ST),(OGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11234.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 670 total characters: > All characters are of type 'unord' > All characters have equal weight > 455 characters are constant > 174 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 41 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205359 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 295 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,AGI),(MT,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11347.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1027 total characters: > All characters are of type 'unord' > All characters have equal weight > 809 characters are constant > 169 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 49 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203301 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 233 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,GM),(LJ,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11559.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 960 total characters: > All characters are of type 'unord' > All characters have equal weight > 666 characters are constant > 213 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 81 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203745 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 371 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),GM),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11566.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1053 total characters: > All characters are of type 'unord' > All characters have equal weight > 740 characters are constant > 242 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 71 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224892 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 383 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11726.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 819 total characters: > All characters are of type 'unord' > All characters have equal weight > 568 characters are constant > 130 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 121 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC272547 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 268 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11728.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 618 total characters: > All characters are of type 'unord' > All characters have equal weight > 293 characters are constant > 93 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 232 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14471 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 806 > Score of best tree(s) found = 717 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((((LJ,MT),GM),(GM,GM)),MT),((ST,ST),ST)),(((AGI,AGI),AGI),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11781.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1100 total characters: > All characters are of type 'unord' > All characters have equal weight > 762 characters are constant > 271 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 67 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC206578 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 428 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),AGI),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11828.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 885 total characters: > All characters are of type 'unord' > All characters have equal weight > 706 characters are constant > 144 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 35 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204259 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 200 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl11847.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 945 total characters: > All characters are of type 'unord' > All characters have equal weight > 793 characters are constant > 134 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 18 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203705 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 177 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl1214.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 824 total characters: > All characters are of type 'unord' > All characters have equal weight > 596 characters are constant > 188 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 40 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC113069 2) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 284 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((ST,ST),PGI),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl1221.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1053 total characters: > All characters are of type 'unord' > All characters have equal weight > 719 characters are constant > 206 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 128 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214957 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 36 > Score of best tree(s) found = 452 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),((GM,GM),MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl12460.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1288 total characters: > All characters are of type 'unord' > All characters have equal weight > 734 characters are constant > 179 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 375 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261209 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 67 > Score of best tree(s) found = 1131 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),(ST,MT)),(PGI,(OGI,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl12473.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1833 total characters: > All characters are of type 'unord' > All characters have equal weight > 1152 characters are constant > 309 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 372 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = PGI TC59207 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 347 > Score of best tree(s) found = 1166 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((PGI,PGI),((AGI,AGI),AGI)),(ST,ST)),MT),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:09 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl12863.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 705 total characters: > All characters are of type 'unord' > All characters have equal weight > 386 characters are constant > 50 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 269 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252061 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 22567 > Score of best tree(s) found = 1476 > Number of trees retained = 4 > Time used = <1 sec (CPU time = 0.05 sec) ] tree PAUP_1 = [&R] ((((((AGI,AGI),AGI),AGI),((ST,ST),ST)),PGI),((((OGI,OGI),(OGI,OGI)),(GM,((LJ,MT),(MT,GM)))),((GM,GM),(GM,LJ)))):0.2500; tree PAUP_2 = [&R] ((((((AGI,AGI),AGI),AGI),((ST,ST),ST)),PGI),((((OGI,OGI),(OGI,OGI)),(GM,((LJ,MT),(MT,GM)))),(((GM,GM),GM),LJ))):0.2500; tree PAUP_3 = [&R] ((((((AGI,AGI),AGI),AGI),(ST,ST)),ST),(((((OGI,OGI),(OGI,OGI)),(GM,((LJ,MT),(MT,GM)))),((GM,GM),(GM,LJ))),PGI)):0.2500; tree PAUP_4 = [&R] ((((((AGI,AGI),AGI),AGI),((ST,ST),ST)),PGI),((((OGI,OGI),(OGI,OGI)),((GM,(MT,GM)),(LJ,MT))),(((GM,GM),GM),LJ))):0.2500; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl12956.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1808 total characters: > All characters are of type 'unord' > All characters have equal weight > 1160 characters are constant > 491 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 157 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261191 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 850 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),(GM,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13000.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 648 total characters: > All characters are of type 'unord' > All characters have equal weight > 330 characters are constant > 33 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 285 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = PGI TC73239 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 37876 > Score of best tree(s) found = 1166 > Number of trees retained = 13 > Time used = <1 sec (CPU time = 0.06 sec) ] tree PAUP_1 = [&R] ((((PGI,PGI),((ST,(ST,ST)),ST)),(((GM,(GM,GM)),GM),(MT,(MT,MT)))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_2 = [&R] ((((PGI,PGI),((ST,(ST,ST)),ST)),((((GM,GM),(GM,GM)),MT),(MT,MT))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_3 = [&R] ((((PGI,PGI),((ST,(ST,ST)),ST)),(((GM,((GM,GM),GM)),MT),(MT,MT))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_4 = [&R] ((((PGI,PGI),((ST,(ST,ST)),ST)),((((GM,(GM,GM)),GM),MT),(MT,MT))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_5 = [&R] ((((PGI,PGI),((ST,(ST,ST)),ST)),(((GM,GM),(GM,GM)),(MT,(MT,MT)))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_6 = [&R] ((((PGI,PGI),((ST,ST),(ST,ST))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))),(((GM,(GM,GM)),GM),(MT,(MT,MT)))):0.0769; tree PAUP_7 = [&R] ((((PGI,PGI),((ST,ST),(ST,ST))),((((GM,GM),(GM,GM)),MT),(MT,MT))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_8 = [&R] ((((PGI,PGI),((ST,ST),(ST,ST))),(((GM,((GM,GM),GM)),MT),(MT,MT))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_9 = [&R] ((((PGI,PGI),((ST,ST),(ST,ST))),((((GM,(GM,GM)),GM),MT),(MT,MT))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_10 = [&R] ((((PGI,PGI),((ST,ST),(ST,ST))),(((GM,GM),(GM,GM)),(MT,(MT,MT)))),(((AGI,AGI),(((OGI,OGI),OGI),OGI)),(AGI,AGI))):0.0769; tree PAUP_11 = [&R] ((((PGI,PGI),((ST,ST),(ST,ST))),(((((GM,(GM,GM)),GM),MT),(MT,MT)),(AGI,AGI))),((AGI,AGI),(((OGI,OGI),OGI),OGI))):0.0769; tree PAUP_12 = [&R] ((((PGI,PGI),((ST,ST),(ST,ST))),(((((GM,GM),(GM,GM)),MT),(MT,MT)),(AGI,AGI))),((AGI,AGI),(((OGI,OGI),OGI),OGI))):0.0769; tree PAUP_13 = [&R] ((((PGI,PGI),((ST,ST),(ST,ST))),((((GM,((GM,GM),GM)),MT),(MT,MT)),(AGI,AGI))),((AGI,AGI),(((OGI,OGI),OGI),OGI))):0.0769; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:12 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13024.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1624 total characters: > All characters are of type 'unord' > All characters have equal weight > 996 characters are constant > 211 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 417 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215551 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 988 > Score of best tree(s) found = 1382 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((GM,LJ),GM),MT),(AGI,AGI)),(((OGI,OGI),(PGI,PGI)),(ST,ST))):0.5000; tree PAUP_2 = [&R] (((((GM,LJ),MT),GM),(AGI,AGI)),(((OGI,OGI),(PGI,PGI)),(ST,ST))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:13 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl1317.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 940 total characters: > All characters are of type 'unord' > All characters have equal weight > 628 characters are constant > 260 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 52 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC227779 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 386 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(LJ,MT)),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:13 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13199.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 633 total characters: > All characters are of type 'unord' > All characters have equal weight > 407 characters are constant > 156 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 70 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226861 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 330 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),(AGI,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:13 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13219.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 613 total characters: > All characters are of type 'unord' > All characters have equal weight > 366 characters are constant > 136 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 111 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14469 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 117 > Score of best tree(s) found = 360 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,(MT,GM)),(((GM,GM),MT),LJ)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:13 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl1331.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1824 total characters: > All characters are of type 'unord' > All characters have equal weight > 1180 characters are constant > 479 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 165 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214150 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 807 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,MT),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:13 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13360.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2178 total characters: > All characters are of type 'unord' > All characters have equal weight > 1188 characters are constant > 370 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 620 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC271776 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 118 > Score of best tree(s) found = 1923 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,(OGI,OGI)),(ST,((LJ,MT),(GM,MT)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13490.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1375 total characters: > All characters are of type 'unord' > All characters have equal weight > 831 characters are constant > 306 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 238 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225348 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 846 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),(OGI,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13587.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 818 total characters: > All characters are of type 'unord' > All characters have equal weight > 411 characters are constant > 124 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 283 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC263841 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 594 > Score of best tree(s) found = 1011 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),((GM,GM),MT)),ST),(((((LJ,MT),GM),LJ),AGI),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13668.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1190 total characters: > All characters are of type 'unord' > All characters have equal weight > 785 characters are constant > 336 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 69 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224653 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 498 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl13925.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 806 total characters: > All characters are of type 'unord' > All characters have equal weight > 391 characters are constant > 87 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 328 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251689 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 377 > Score of best tree(s) found = 1019 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),(ST,ST)),((GM,(LJ,(MT,MT))),((GM,GM),MT))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl14035.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1344 total characters: > All characters are of type 'unord' > All characters have equal weight > 845 characters are constant > 267 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 232 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225039 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 624 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl14044.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1316 total characters: > All characters are of type 'unord' > All characters have equal weight > 1084 characters are constant > 201 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 31 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225547 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 254 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),MT),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl14094.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 853 total characters: > All characters are of type 'unord' > All characters have equal weight > 520 characters are constant > 192 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 141 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC100691 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 69 > Score of best tree(s) found = 545 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((MT,MT),((GM,LJ),GM)),(ST,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl14656.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1612 total characters: > All characters are of type 'unord' > All characters have equal weight > 1170 characters are constant > 329 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 113 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224836 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 585 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),AGI),OGI),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl146.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 684 total characters: > All characters are of type 'unord' > All characters have equal weight > 407 characters are constant > 123 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 154 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC228055 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 216 > Score of best tree(s) found = 523 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((((GM,GM),MT),GM),MT),ST),((AGI,AGI),PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl15009.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2474 total characters: > All characters are of type 'unord' > All characters have equal weight > 1326 characters are constant > 352 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 796 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225476 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 718 > Score of best tree(s) found = 2954 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((GM,LJ),MT),ST),((((PGI,PGI),AGI),ST),GM)),(OGI,(OGI,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl15037.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 841 total characters: > All characters are of type 'unord' > All characters have equal weight > 517 characters are constant > 268 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 56 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC207841 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 383 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl15627.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1767 total characters: > All characters are of type 'unord' > All characters have equal weight > 1155 characters are constant > 451 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 161 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC112205 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 753 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((ST,ST),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl15896.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 984 total characters: > All characters are of type 'unord' > All characters have equal weight > 629 characters are constant > 253 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 102 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC206489 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 24 > Score of best tree(s) found = 498 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (GM,((LJ,MT),(GM,MT))):0.5000; tree PAUP_2 = [&R] ((GM,MT),(LJ,(GM,MT))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl15958.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 596 total characters: > All characters are of type 'unord' > All characters have equal weight > 387 characters are constant > 134 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 75 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC208546 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 14 > Score of best tree(s) found = 300 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),LJ),AGI),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl16447.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 657 total characters: > All characters are of type 'unord' > All characters have equal weight > 394 characters are constant > 100 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 163 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14183 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 123 > Score of best tree(s) found = 499 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,(GM,GM)),MT),(ST,ST)),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl16715.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 657 total characters: > All characters are of type 'unord' > All characters have equal weight > 468 characters are constant > 153 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 36 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC229755 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 233 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl16758.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 952 total characters: > All characters are of type 'unord' > All characters have equal weight > 552 characters are constant > 104 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 296 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225563 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 344 > Score of best tree(s) found = 839 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((GM,GM),LJ),GM),LJ),((MT,(ST,ST)),MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl16839.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1198 total characters: > All characters are of type 'unord' > All characters have equal weight > 678 characters are constant > 217 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 303 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204360 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 114 > Score of best tree(s) found = 854 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),MT),((AGI,AGI),AGI)),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl16926.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1026 total characters: > All characters are of type 'unord' > All characters have equal weight > 462 characters are constant > 92 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 472 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC249902 3) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 25789 > Score of best tree(s) found = 2775 > Number of trees retained = 5 > Time used = <1 sec (CPU time = 0.07 sec) ] tree PAUP_1 = [&R] (((((OGI,OGI),OGI),OGI),((OGI,OGI),PGI)),((((((AGI,AGI),AGI),(ST,ST)),((((GM,GM),LJ),MT),(LJ,MT))),PGI),(((AGI,AGI),AGI),((ST,ST),GM)))):0.2000; tree PAUP_2 = [&R] ((((((OGI,OGI),OGI),OGI),(((AGI,AGI),AGI),((ST,ST),GM))),((((AGI,AGI),AGI),(ST,ST)),((((GM,GM),LJ),MT),(LJ,MT)))),(PGI,((OGI,OGI),PGI))):0.2000; tree PAUP_3 = [&R] ((((((OGI,OGI),OGI),OGI),((OGI,OGI),PGI)),PGI),(((((AGI,AGI),AGI),(ST,ST)),((((GM,GM),LJ),MT),(LJ,MT))),(((AGI,AGI),AGI),((ST,ST),GM)))):0.2000; tree PAUP_4 = [&R] (((((OGI,OGI),OGI),OGI),((OGI,OGI),PGI)),((((((AGI,AGI),AGI),(ST,ST)),((((GM,GM),LJ),(LJ,MT)),MT)),PGI),(((AGI,AGI),AGI),((ST,ST),GM)))):0.2000; tree PAUP_5 = [&R] (((((((OGI,OGI),OGI),OGI),(OGI,OGI)),PGI),PGI),(((((AGI,AGI),AGI),(ST,ST)),((((GM,GM),LJ),(LJ,MT)),MT)),(((AGI,AGI),AGI),((ST,ST),GM)))):0.2000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:22 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl17064.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 698 total characters: > All characters are of type 'unord' > All characters have equal weight > 519 characters are constant > 140 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 39 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215786 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 207 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:22 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl17188.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 667 total characters: > All characters are of type 'unord' > All characters have equal weight > 350 characters are constant > 111 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 206 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216180 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 232 > Score of best tree(s) found = 584 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),(ST,ST)),PGI),(AGI,(OGI,OGI))):0.5000; tree PAUP_2 = [&R] ((((GM,MT),AGI),(ST,ST)),(PGI,(OGI,OGI))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:22 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl17219.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1212 total characters: > All characters are of type 'unord' > All characters have equal weight > 671 characters are constant > 169 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 372 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252105 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 458 > Score of best tree(s) found = 1219 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),MT),(ST,PGI)),(OGI,(ST,((OGI,OGI),OGI)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:22 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl17302.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1124 total characters: > All characters are of type 'unord' > All characters have equal weight > 601 characters are constant > 180 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 343 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC262785 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 281 > Score of best tree(s) found = 1179 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),OGI),((((GM,GM),(LJ,MT)),MT),(ST,PGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:22 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl17571.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 763 total characters: > All characters are of type 'unord' > All characters have equal weight > 388 characters are constant > 130 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 245 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205302 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1154 > Score of best tree(s) found = 879 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((((GM,GM),MT),ST),(GM,MT)),(ST,ST)),(((AGI,AGI),AGI),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:23 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl17703.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 960 total characters: > All characters are of type 'unord' > All characters have equal weight > 476 characters are constant > 86 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 398 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251912 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12947 > Score of best tree(s) found = 1742 > Number of trees retained = 4 > Time used = <1 sec (CPU time = 0.04 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),(((GM,LJ),MT),(ST,ST))),(((GM,MT),(((GM,GM),MT),(LJ,LJ))),OGI)),(ST,ST)),(AGI,((PGI,PGI),ST))):0.2500; tree PAUP_2 = [&R] (((((AGI,AGI),(((GM,LJ),MT),(ST,ST))),(((GM,MT),(((GM,GM),(LJ,LJ)),MT)),OGI)),(ST,ST)),(AGI,((PGI,PGI),ST))):0.2500; tree PAUP_3 = [&R] ((((AGI,AGI),((GM,LJ),MT)),(((GM,MT),(((GM,GM),(LJ,LJ)),MT)),OGI)),((ST,ST),(((ST,ST),AGI),((PGI,PGI),ST)))):0.2500; tree PAUP_4 = [&R] ((((((AGI,AGI),((GM,LJ),MT)),((GM,MT),(((GM,GM),(LJ,LJ)),MT))),(ST,ST)),OGI),(((ST,ST),AGI),((PGI,PGI),ST))):0.2500; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:25 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl17819.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1039 total characters: > All characters are of type 'unord' > All characters have equal weight > 507 characters are constant > 234 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 298 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252043 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 114 > Score of best tree(s) found = 956 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),ST),(GM,(LJ,MT))),(OGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:25 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl18180.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 816 total characters: > All characters are of type 'unord' > All characters have equal weight > 578 characters are constant > 200 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 38 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC227789 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 287 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:25 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl18481.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1831 total characters: > All characters are of type 'unord' > All characters have equal weight > 1021 characters are constant > 210 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 600 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261065 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 254 > Score of best tree(s) found = 1700 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),AGI),((GM,LJ),MT)),((ST,ST),(OGI,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:26 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl18685.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1150 total characters: > All characters are of type 'unord' > All characters have equal weight > 903 characters are constant > 157 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 90 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215639 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 326 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),LJ),GM),(PGI,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:26 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl18771.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 853 total characters: > All characters are of type 'unord' > All characters have equal weight > 411 characters are constant > 78 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 364 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251426 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2000 > Score of best tree(s) found = 1444 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),(PGI,PGI)),((ST,ST),ST)),(((OGI,OGI),OGI),((GM,MT),((GM,MT),((LJ,MT),GM))))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:27 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl18778.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1285 total characters: > All characters are of type 'unord' > All characters have equal weight > 685 characters are constant > 138 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 462 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214207 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1440 > Score of best tree(s) found = 1539 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),MT),(ST,ST)),(GM,((LJ,LJ),((((MT,MT),MT),MT),(MT,MT))))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:28 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl18904.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1356 total characters: > All characters are of type 'unord' > All characters have equal weight > 801 characters are constant > 290 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 265 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC264699 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 872 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),(((GM,MT),ST),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:28 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl19036.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 962 total characters: > All characters are of type 'unord' > All characters have equal weight > 495 characters are constant > 110 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 357 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204209 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 818 > Score of best tree(s) found = 1117 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,(MT,LJ)),GM),((OGI,OGI),OGI)),((AGI,AGI),((ST,(ST,ST)),(ST,ST)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:28 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl19150.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 799 total characters: > All characters are of type 'unord' > All characters have equal weight > 347 characters are constant > 141 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 311 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC8196 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2529 > Score of best tree(s) found = 1365 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((LJ,LJ),(((GM,GM),GM),((MT,MT),MT))),(OGI,OGI)),AGI),((((PGI,PGI),PGI),(ST,ST)),((AGI,AGI),AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:29 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl19282.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 667 total characters: > All characters are of type 'unord' > All characters have equal weight > 477 characters are constant > 128 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 62 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214055 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 214 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl19452.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 3042 total characters: > All characters are of type 'unord' > All characters have equal weight > 1808 characters are constant > 543 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 691 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC252663 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 2052 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((OGI,OGI),OGI),((AGI,AGI),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl19643.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 898 total characters: > All characters are of type 'unord' > All characters have equal weight > 505 characters are constant > 180 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 213 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261232 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 193 > Score of best tree(s) found = 696 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),PGI),((((MT,MT),LJ),(GM,GM)),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl19741.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1863 total characters: > All characters are of type 'unord' > All characters have equal weight > 1321 characters are constant > 479 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 63 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC207100 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 625 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),MT),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl20207.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 639 total characters: > All characters are of type 'unord' > All characters have equal weight > 396 characters are constant > 130 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 113 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215144 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 36 > Score of best tree(s) found = 360 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),((ST,ST),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl20247.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 637 total characters: > All characters are of type 'unord' > All characters have equal weight > 498 characters are constant > 121 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 18 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC232252 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 152 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),AGI),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl2042.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 771 total characters: > All characters are of type 'unord' > All characters have equal weight > 599 characters are constant > 144 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 28 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC11137 2) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 217 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,MT),GM),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl20467.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 635 total characters: > All characters are of type 'unord' > All characters have equal weight > 378 characters are constant > 113 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 144 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC254998 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 452 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),(GM,MT)),(ST,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl20700.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 603 total characters: > All characters are of type 'unord' > All characters have equal weight > 398 characters are constant > 125 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 80 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224667 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 276 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),(LJ,MT)),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl20804.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1431 total characters: > All characters are of type 'unord' > All characters have equal weight > 840 characters are constant > 380 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 211 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205937 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 876 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,PGI),(OGI,ST)),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl21023.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1628 total characters: > All characters are of type 'unord' > All characters have equal weight > 869 characters are constant > 242 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 517 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225439 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 455 > Score of best tree(s) found = 1873 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(LJ,((((AGI,AGI),(ST,ST)),MT),MT))),(OGI,(PGI,PGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl21524.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1647 total characters: > All characters are of type 'unord' > All characters have equal weight > 1291 characters are constant > 323 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 33 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216797 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 420 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(LJ,MT)),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl21617.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 975 total characters: > All characters are of type 'unord' > All characters have equal weight > 657 characters are constant > 276 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 42 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC265090 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 382 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (AGI,((GM,GM),MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl21654.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 869 total characters: > All characters are of type 'unord' > All characters have equal weight > 413 characters are constant > 199 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 257 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC251685 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 138 > Score of best tree(s) found = 876 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((OGI,OGI),PGI),((((GM,GM),MT),ST),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl21807.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1029 total characters: > All characters are of type 'unord' > All characters have equal weight > 694 characters are constant > 231 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 104 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205723 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 388 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),MT),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl21859.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1413 total characters: > All characters are of type 'unord' > All characters have equal weight > 913 characters are constant > 308 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 192 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC112312 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 709 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((ST,ST),(GM,MT)),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl22015.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 784 total characters: > All characters are of type 'unord' > All characters have equal weight > 294 characters are constant > 73 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 417 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251838 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 5716 > Score of best tree(s) found = 1953 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.02 sec) ] tree PAUP_1 = [&R] (((((((AGI,AGI),(((GM,GM),MT),LJ)),ST),((OGI,OGI),OGI)),(((AGI,AGI),ST),((GM,(MT,LJ)),MT))),PGI),(PGI,(((AGI,ST),MT),GM))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl22054.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 787 total characters: > All characters are of type 'unord' > All characters have equal weight > 595 characters are constant > 152 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 40 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214789 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 209 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl2213.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 3317 total characters: > All characters are of type 'unord' > All characters have equal weight > 2333 characters are constant > 676 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 308 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC270640 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 1232 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),(LJ,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl22200.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 643 total characters: > All characters are of type 'unord' > All characters have equal weight > 515 characters are constant > 106 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 22 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC11095 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 136 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,(GM,GM)),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl22344.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1598 total characters: > All characters are of type 'unord' > All characters have equal weight > 720 characters are constant > 188 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 690 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251347 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1366 > Score of best tree(s) found = 2458 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),((GM,LJ),MT)),ST),OGI),(((AGI,AGI),((GM,(LJ,MT)),ST)),((OGI,OGI),OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl22554.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 799 total characters: > All characters are of type 'unord' > All characters have equal weight > 350 characters are constant > 153 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 296 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225619 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2266 > Score of best tree(s) found = 1078 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((((GM,GM),GM),GM),((GM,LJ),MT)),MT),((((AGI,AGI),ST),((GM,MT),MT)),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl22798.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1549 total characters: > All characters are of type 'unord' > All characters have equal weight > 994 characters are constant > 305 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 250 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251887 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 734 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),ST),(MT,LJ)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl23032.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1131 total characters: > All characters are of type 'unord' > All characters have equal weight > 623 characters are constant > 237 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 271 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC219468 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 832 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),(GM,LJ)),(ST,(AGI,AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl23191.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 688 total characters: > All characters are of type 'unord' > All characters have equal weight > 431 characters are constant > 157 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 100 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14595 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 54 > Score of best tree(s) found = 397 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,GM),MT),(AGI,ST)),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl23200.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1032 total characters: > All characters are of type 'unord' > All characters have equal weight > 711 characters are constant > 143 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 178 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225031 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 98 > Score of best tree(s) found = 480 > Number of trees retained = 3 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),MT),MT),(GM,GM)):0.3333; tree PAUP_2 = [&R] (((GM,(LJ,MT)),MT),(GM,GM)):0.3333; tree PAUP_3 = [&R] (((GM,LJ),(MT,MT)),(GM,GM)):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl23212.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 985 total characters: > All characters are of type 'unord' > All characters have equal weight > 667 characters are constant > 92 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 226 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC9146 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 188 > Score of best tree(s) found = 624 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((LJ,MT),GM),ST),(PGI,PGI)),((GM,MT),GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl23259.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1033 total characters: > All characters are of type 'unord' > All characters have equal weight > 759 characters are constant > 221 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 53 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC231304 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 332 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),OGI),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl2335.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1496 total characters: > All characters are of type 'unord' > All characters have equal weight > 914 characters are constant > 336 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 246 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204560 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 821 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl23648.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1336 total characters: > All characters are of type 'unord' > All characters have equal weight > 824 characters are constant > 182 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 330 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC113631 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 719 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((ST,ST),((GM,MT),(AGI,AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl23770.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2238 total characters: > All characters are of type 'unord' > All characters have equal weight > 1130 characters are constant > 211 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 897 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC259649 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 8636 > Score of best tree(s) found = 3817 > Number of trees retained = 3 > Time used = <1 sec (CPU time = 0.03 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),AGI),AGI),(((AGI,((MT,MT),(ST,ST))),PGI),PGI)),((((GM,MT),GM),((ST,ST),ST)),((OGI,OGI),OGI))):0.3333; tree PAUP_2 = [&R] ((((((AGI,AGI),AGI),AGI),((OGI,OGI),OGI)),((GM,MT),GM)),(((ST,ST),ST),(((AGI,((MT,MT),(ST,ST))),PGI),PGI))):0.3333; tree PAUP_3 = [&R] (((((AGI,AGI),AGI),AGI),(((AGI,((MT,MT),(ST,ST))),PGI),PGI)),((((GM,MT),((ST,ST),ST)),GM),((OGI,OGI),OGI))):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:41 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl23903.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 776 total characters: > All characters are of type 'unord' > All characters have equal weight > 464 characters are constant > 117 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 195 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252815 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 523 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),((GM,(LJ,MT)),(ST,ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:41 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24064.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 711 total characters: > All characters are of type 'unord' > All characters have equal weight > 359 characters are constant > 69 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 283 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC270729 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 638 > Score of best tree(s) found = 1028 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),AGI),AGI),(ST,ST)),(((GM,GM),(GM,LJ)),((MT,MT),MT))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:41 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl2407.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 624 total characters: > All characters are of type 'unord' > All characters have equal weight > 360 characters are constant > 104 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 160 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214802 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 120 > Score of best tree(s) found = 454 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),(GM,MT)),LJ),((GM,GM),MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:42 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24140.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1285 total characters: > All characters are of type 'unord' > All characters have equal weight > 867 characters are constant > 224 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 194 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224671 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 567 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),GM),ST),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:42 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24244.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 904 total characters: > All characters are of type 'unord' > All characters have equal weight > 745 characters are constant > 144 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 15 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205143 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 194 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:42 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24361.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 944 total characters: > All characters are of type 'unord' > All characters have equal weight > 500 characters are constant > 234 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 210 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204556 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 156 > Score of best tree(s) found = 727 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,((MT,LJ),(LJ,MT))),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:42 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24422.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1420 total characters: > All characters are of type 'unord' > All characters have equal weight > 721 characters are constant > 216 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 483 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC94382 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1731 > Score of best tree(s) found = 1839 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((((MT,LJ),(GM,GM)),LJ),GM),MT),(AGI,AGI)),((OGI,OGI),((ST,ST),ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24434.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1303 total characters: > All characters are of type 'unord' > All characters have equal weight > 783 characters are constant > 238 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 282 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC227659 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 765 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(MT,GM)),((AGI,AGI),(AGI,AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24521.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1155 total characters: > All characters are of type 'unord' > All characters have equal weight > 842 characters are constant > 218 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 95 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14068 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 364 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,MT),(GM,GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24851.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1003 total characters: > All characters are of type 'unord' > All characters have equal weight > 661 characters are constant > 208 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 134 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203933 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 215 > Score of best tree(s) found = 517 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(((ST,ST),ST),OGI)),((LJ,(GM,GM)),MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl24854.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 801 total characters: > All characters are of type 'unord' > All characters have equal weight > 597 characters are constant > 154 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 50 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC16712 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 270 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,MT),GM),AGI),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl25252.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2223 total characters: > All characters are of type 'unord' > All characters have equal weight > 1780 characters are constant > 358 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 85 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC271981 3) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 4 > Score of best tree(s) found = 563 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,OGI),LJ),PGI):0.5000; tree PAUP_2 = [&R] (((AGI,LJ),OGI),PGI):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl25400.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 854 total characters: > All characters are of type 'unord' > All characters have equal weight > 584 characters are constant > 162 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 108 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225430 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 385 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl25482.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 740 total characters: > All characters are of type 'unord' > All characters have equal weight > 450 characters are constant > 143 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 147 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC107079 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 70 > Score of best tree(s) found = 427 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((MT,MT),(GM,GM)),LJ),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl25735.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1182 total characters: > All characters are of type 'unord' > All characters have equal weight > 770 characters are constant > 283 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 129 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214649 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 573 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),LJ),MT),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl25972.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1849 total characters: > All characters are of type 'unord' > All characters have equal weight > 948 characters are constant > 196 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 705 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC265613 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 392 > Score of best tree(s) found = 1962 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((OGI,OGI),OGI),OGI),(GM,MT)),(((AGI,AGI),(AGI,AGI)),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26357.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1248 total characters: > All characters are of type 'unord' > All characters have equal weight > 693 characters are constant > 311 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 244 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216793 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 827 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),AGI),(OGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26386.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 865 total characters: > All characters are of type 'unord' > All characters have equal weight > 470 characters are constant > 102 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 293 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251934 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 4190 > Score of best tree(s) found = 1096 > Number of trees retained = 6 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),((ST,ST),ST)),AGI),(MT,MT)),(LJ,(((GM,GM),OGI),GM))):0.1667; tree PAUP_2 = [&R] (((((AGI,AGI),AGI),((ST,ST),ST)),(MT,MT)),(LJ,(((GM,GM),OGI),GM))):0.1667; tree PAUP_3 = [&R] (((((AGI,AGI),AGI),((ST,ST),ST)),(MT,MT)),(LJ,(((GM,GM),OGI),GM))):0.1667; tree PAUP_4 = [&R] ((((((AGI,AGI),AGI),((ST,ST),ST)),(MT,MT)),LJ),(GM,(GM,(GM,OGI)))):0.1667; tree PAUP_5 = [&R] ((((((AGI,AGI),AGI),((ST,ST),ST)),(MT,MT)),LJ),((GM,GM),(GM,OGI))):0.1667; tree PAUP_6 = [&R] ((((((AGI,AGI),AGI),(ST,(ST,ST))),(MT,MT)),LJ),(GM,(GM,(GM,OGI)))):0.1667; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:45 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26400.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1130 total characters: > All characters are of type 'unord' > All characters have equal weight > 695 characters are constant > 362 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 73 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC253597 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 574 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),ST),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:45 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26527.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 699 total characters: > All characters are of type 'unord' > All characters have equal weight > 544 characters are constant > 122 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 33 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14680 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 166 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,(GM,GM)),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:45 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26563.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1272 total characters: > All characters are of type 'unord' > All characters have equal weight > 913 characters are constant > 256 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 103 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204490 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 487 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),GM),LJ),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:45 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26600.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1009 total characters: > All characters are of type 'unord' > All characters have equal weight > 686 characters are constant > 231 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 92 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC16020 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 388 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,MT),(PGI,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:45 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26602.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1383 total characters: > All characters are of type 'unord' > All characters have equal weight > 805 characters are constant > 269 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 309 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC206613 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 907 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,OGI),(ST,((AGI,AGI),AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:45 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26711.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1907 total characters: > All characters are of type 'unord' > All characters have equal weight > 1056 characters are constant > 378 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 473 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225919 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 74 > Score of best tree(s) found = 1600 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),MT),ST),(AGI,(OGI,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:46 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26714.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 684 total characters: > All characters are of type 'unord' > All characters have equal weight > 380 characters are constant > 210 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 94 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251988 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 444 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,ST),((GM,MT),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:46 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26731.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 642 total characters: > All characters are of type 'unord' > All characters have equal weight > 338 characters are constant > 72 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 232 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14632 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1101 > Score of best tree(s) found = 699 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((LJ,LJ),((GM,GM),MT)),((GM,GM),GM)),MT),((ST,ST),(AGI,AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:46 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26745.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1935 total characters: > All characters are of type 'unord' > All characters have equal weight > 1068 characters are constant > 273 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 594 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261420 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 117 > Score of best tree(s) found = 1732 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),ST),(GM,MT)),(ST,(PGI,PGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:46 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26865.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2978 total characters: > All characters are of type 'unord' > All characters have equal weight > 1599 characters are constant > 403 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 976 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC227829 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1280 > Score of best tree(s) found = 3266 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((((GM,GM),LJ),MT),((LJ,MT),GM)),(AGI,AGI)),((MT,ST),(ST,ST))):0.5000; tree PAUP_2 = [&R] (((((GM,GM),(LJ,MT)),((LJ,MT),GM)),(AGI,AGI)),((MT,ST),(ST,ST))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl26924.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1483 total characters: > All characters are of type 'unord' > All characters have equal weight > 1021 characters are constant > 347 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 115 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214755 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 539 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl27083.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1281 total characters: > All characters are of type 'unord' > All characters have equal weight > 871 characters are constant > 315 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 95 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC263501 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 533 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl27468.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1288 total characters: > All characters are of type 'unord' > All characters have equal weight > 715 characters are constant > 348 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 225 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215414 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 892 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),(LJ,MT)),(OGI,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl274.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 712 total characters: > All characters are of type 'unord' > All characters have equal weight > 409 characters are constant > 116 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 187 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC121984 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 70 > Score of best tree(s) found = 468 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((ST,ST),OGI),((GM,MT),(AGI,AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl27519.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 888 total characters: > All characters are of type 'unord' > All characters have equal weight > 494 characters are constant > 140 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 254 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC112613 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 71 > Score of best tree(s) found = 680 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((ST,ST),(ST,ST)),((GM,LJ),MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl27837.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1502 total characters: > All characters are of type 'unord' > All characters have equal weight > 728 characters are constant > 69 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 705 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251358 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 59604 > Score of best tree(s) found = 6996 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.16 sec) ] tree PAUP_1 = [&R] ((((((((AGI,AGI),AGI),AGI),((((LJ,GM),MT),ST),(ST,((((GM,GM),LJ),((MT,MT),MT)),(ST,ST))))),(((MT,ST),(AGI,AGI)),(AGI,AGI))),(PGI,PGI)),((GM,LJ),PGI)),((((PGI,PGI),PGI),PGI),(((AGI,ST),OGI),(((((OGI,OGI),OGI),OGI),(GM,((GM,MT),GM))),(GM,MT))))):0.5000; tree PAUP_2 = [&R] (((((((AGI,AGI),AGI),AGI),((((LJ,GM),MT),ST),(ST,((((GM,GM),LJ),((MT,MT),MT)),(ST,ST))))),(((MT,ST),(AGI,AGI)),(AGI,AGI))),(PGI,PGI)),(((GM,LJ),PGI),(((((PGI,PGI),PGI),PGI),((AGI,ST),OGI)),(((((OGI,OGI),OGI),OGI),(GM,((GM,MT),GM))),(GM,MT))))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:13 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl27859.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1023 total characters: > All characters are of type 'unord' > All characters have equal weight > 544 characters are constant > 172 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 307 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225230 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 400 > Score of best tree(s) found = 908 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((((GM,GM),GM),LJ),(MT,MT)),ST),(AGI,AGI)):0.5000; tree PAUP_2 = [&R] (((((((GM,GM),GM),LJ),MT),MT),ST),(AGI,AGI)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:13 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl27918.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 738 total characters: > All characters are of type 'unord' > All characters have equal weight > 480 characters are constant > 162 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 96 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC16665 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 356 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,MT),(GM,LJ)),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:13 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl27921.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 773 total characters: > All characters are of type 'unord' > All characters have equal weight > 294 characters are constant > 109 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 370 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215959 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2828 > Score of best tree(s) found = 1492 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((((((GM,MT),LJ),AGI),(OGI,OGI)),ST),PGI),((PGI,PGI),(GM,MT))),(((OGI,OGI),OGI),ST)):0.5000; tree PAUP_2 = [&R] (((((((GM,MT),LJ),AGI),(OGI,OGI)),ST),((PGI,PGI),((GM,MT),PGI))),(((OGI,OGI),OGI),ST)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28114.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 883 total characters: > All characters are of type 'unord' > All characters have equal weight > 594 characters are constant > 121 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 168 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204009 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 422 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),LJ),MT),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28261.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1269 total characters: > All characters are of type 'unord' > All characters have equal weight > 767 characters are constant > 254 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 248 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216927 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 57 > Score of best tree(s) found = 852 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),(AGI,PGI)),(ST,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28336.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1606 total characters: > All characters are of type 'unord' > All characters have equal weight > 1036 characters are constant > 423 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 147 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC95246 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 706 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((MT,ST),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28418.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 906 total characters: > All characters are of type 'unord' > All characters have equal weight > 464 characters are constant > 209 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 233 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261287 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 286 > Score of best tree(s) found = 846 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),AGI),AGI),((((GM,GM),MT),ST),(OGI,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:14 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28588.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 928 total characters: > All characters are of type 'unord' > All characters have equal weight > 529 characters are constant > 116 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 283 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214625 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 68 > Score of best tree(s) found = 759 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),LJ),(ST,MT)),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28756.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1078 total characters: > All characters are of type 'unord' > All characters have equal weight > 734 characters are constant > 190 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 154 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215536 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 472 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28764.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1042 total characters: > All characters are of type 'unord' > All characters have equal weight > 564 characters are constant > 227 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 251 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214549 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 191 > Score of best tree(s) found = 843 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((GM,(GM,MT)),MT),PGI),((ST,ST),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28765.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 630 total characters: > All characters are of type 'unord' > All characters have equal weight > 382 characters are constant > 133 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 115 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252790 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 363 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),((GM,GM),MT)),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28854.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1325 total characters: > All characters are of type 'unord' > All characters have equal weight > 699 characters are constant > 188 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 438 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261212 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 858 > Score of best tree(s) found = 1520 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),((ST,ST),ST)),MT),(LJ,(GM,((GM,LJ),OGI)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:15 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl28942.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1135 total characters: > All characters are of type 'unord' > All characters have equal weight > 605 characters are constant > 110 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 420 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251826 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 392 > Score of best tree(s) found = 1280 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),AGI),(((GM,GM),LJ),MT)),(((ST,ST),ST),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29095.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 637 total characters: > All characters are of type 'unord' > All characters have equal weight > 392 characters are constant > 154 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 91 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC8594 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 13 > Score of best tree(s) found = 329 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,GM),MT),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29136.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1041 total characters: > All characters are of type 'unord' > All characters have equal weight > 870 characters are constant > 145 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 26 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226967 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 4 > Score of best tree(s) found = 219 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(LJ,MT)),MT):0.5000; tree PAUP_2 = [&R] (((GM,MT),LJ),MT):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29160.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1422 total characters: > All characters are of type 'unord' > All characters have equal weight > 1089 characters are constant > 295 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 38 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203995 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 399 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29208.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1674 total characters: > All characters are of type 'unord' > All characters have equal weight > 1358 characters are constant > 287 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 29 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226710 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 373 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),LJ),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29359.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1538 total characters: > All characters are of type 'unord' > All characters have equal weight > 1321 characters are constant > 205 variable characters are 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 = GM TC231525 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 237 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,ST),OGI),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29390.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 762 total characters: > All characters are of type 'unord' > All characters have equal weight > 550 characters are constant > 163 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 49 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC207020 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 242 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29493.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 895 total characters: > All characters are of type 'unord' > All characters have equal weight > 604 characters are constant > 212 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 79 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC228923 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 393 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),(GM,MT)),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29540.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2661 total characters: > All characters are of type 'unord' > All characters have equal weight > 1764 characters are constant > 543 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 354 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214729 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 1118 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),(MT,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29562.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 580 total characters: > All characters are of type 'unord' > All characters have equal weight > 386 characters are constant > 168 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 26 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215849 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 245 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(LJ,MT)),GM):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:16 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl29684.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1586 total characters: > All characters are of type 'unord' > All characters have equal weight > 929 characters are constant > 278 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 379 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251384 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 66 > Score of best tree(s) found = 1086 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),(ST,((GM,MT),(GM,GM)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl30176.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 705 total characters: > All characters are of type 'unord' > All characters have equal weight > 406 characters are constant > 140 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 159 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251889 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 72 > Score of best tree(s) found = 446 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),AGI),(((GM,GM),MT),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl30199.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2595 total characters: > All characters are of type 'unord' > All characters have equal weight > 1668 characters are constant > 564 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 363 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC254957 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 1316 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((OGI,OGI),(GM,GM)),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl3024.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1038 total characters: > All characters are of type 'unord' > All characters have equal weight > 695 characters are constant > 173 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 170 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC7877 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 14 > Score of best tree(s) found = 434 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,MT),GM),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl30423.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 629 total characters: > All characters are of type 'unord' > All characters have equal weight > 355 characters are constant > 142 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 132 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC222962 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 37 > Score of best tree(s) found = 403 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),GM),MT),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl30426.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1736 total characters: > All characters are of type 'unord' > All characters have equal weight > 1257 characters are constant > 411 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 68 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC209528 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 541 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),MT),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl30562.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 655 total characters: > All characters are of type 'unord' > All characters have equal weight > 415 characters are constant > 130 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 110 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC15081 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 208 > Score of best tree(s) found = 409 > Number of trees retained = 3 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,(GM,GM)),MT),AGI),(ST,PGI)):0.3333; tree PAUP_2 = [&R] ((((LJ,MT),(GM,GM)),AGI),(ST,PGI)):0.3333; tree PAUP_3 = [&R] (((((LJ,MT),GM),GM),AGI),(ST,PGI)):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl30715.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 895 total characters: > All characters are of type 'unord' > All characters have equal weight > 434 characters are constant > 96 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 365 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC249274 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 4159 > Score of best tree(s) found = 1515 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((((OGI,OGI),(OGI,OGI)),OGI),(((AGI,AGI),AGI),(ST,ST))),((((GM,GM),GM),(MT,MT)),LJ)),((((GM,GM),MT),MT),(PGI,PGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:19 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl30907.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1086 total characters: > All characters are of type 'unord' > All characters have equal weight > 841 characters are constant > 200 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 45 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC106887 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 284 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((MT,MT),GM),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:19 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl30990.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 617 total characters: > All characters are of type 'unord' > All characters have equal weight > 332 characters are constant > 75 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 210 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC247955 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1371 > Score of best tree(s) found = 788 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((OGI,OGI),(OGI,OGI)),PGI),((AGI,ST),(((((GM,GM),GM),LJ),MT),ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:19 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl31214.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1171 total characters: > All characters are of type 'unord' > All characters have equal weight > 794 characters are constant > 309 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 68 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225706 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 480 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:19 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl31311.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1257 total characters: > All characters are of type 'unord' > All characters have equal weight > 627 characters are constant > 128 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 502 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225385 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1467 > Score of best tree(s) found = 2028 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((GM,MT),PGI),MT),((GM,LJ),MT)),((((AGI,AGI),(OGI,OGI)),AGI),(ST,ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:20 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl31390.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1251 total characters: > All characters are of type 'unord' > All characters have equal weight > 659 characters are constant > 92 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 500 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224561 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1736 > Score of best tree(s) found = 1886 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((GM,MT),ST),((GM,(LJ,MT)),(ST,ST))),(AGI,AGI)),(((OGI,OGI),OGI),((PGI,PGI),PGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:22 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl31476.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1054 total characters: > All characters are of type 'unord' > All characters have equal weight > 593 characters are constant > 81 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 380 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC272561 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 272 > Score of best tree(s) found = 1075 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((AGI,MT),(GM,MT)),ST),((PGI,PGI),((OGI,OGI),OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:22 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl31571.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1172 total characters: > All characters are of type 'unord' > All characters have equal weight > 563 characters are constant > 134 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 475 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251467 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1005 > Score of best tree(s) found = 1924 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),(((((GM,MT),LJ),(GM,GM)),(ST,ST)),(GM,MT))),((AGI,PGI),(AGI,AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:23 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl31617.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 592 total characters: > All characters are of type 'unord' > All characters have equal weight > 432 characters are constant > 126 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 34 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224897 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 186 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:23 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl31654.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 842 total characters: > All characters are of type 'unord' > All characters have equal weight > 585 characters are constant > 124 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 133 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203309 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 106 > Score of best tree(s) found = 400 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),(LJ,MT)),((GM,GM),(LJ,MT))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:23 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl31846.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1522 total characters: > All characters are of type 'unord' > All characters have equal weight > 872 characters are constant > 426 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 224 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC230626 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 928 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),(AGI,ST)),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:23 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl32082.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1060 total characters: > All characters are of type 'unord' > All characters have equal weight > 632 characters are constant > 210 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 218 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC101418 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 655 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((MT,ST),(OGI,((AGI,AGI),AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:23 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl32194.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 702 total characters: > All characters are of type 'unord' > All characters have equal weight > 473 characters are constant > 104 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 125 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC112601 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 285 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((ST,ST),ST),(MT,(GM,GM))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:24 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl32231.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 628 total characters: > All characters are of type 'unord' > All characters have equal weight > 343 characters are constant > 154 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 131 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC271183 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 72 > Score of best tree(s) found = 452 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),((((GM,GM),LJ),MT),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:24 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl3241.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 880 total characters: > All characters are of type 'unord' > All characters have equal weight > 518 characters are constant > 234 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 128 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC227452 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 537 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),(ST,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:24 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl32561.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 681 total characters: > All characters are of type 'unord' > All characters have equal weight > 334 characters are constant > 66 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 281 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC249275 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2271 > Score of best tree(s) found = 1073 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((OGI,OGI),((PGI,PGI),PGI)),(((AGI,AGI),AGI),((((((GM,GM),GM),LJ),(LJ,MT)),MT),(ST,ST)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:24 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl32597.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1083 total characters: > All characters are of type 'unord' > All characters have equal weight > 561 characters are constant > 268 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 254 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226790 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 918 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),MT),(AGI,AGI)),(PGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:25 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl32977.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 615 total characters: > All characters are of type 'unord' > All characters have equal weight > 377 characters are constant > 152 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 86 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC229624 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 315 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),(GM,GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:25 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl3307.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1590 total characters: > All characters are of type 'unord' > All characters have equal weight > 938 characters are constant > 160 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 492 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226496 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 784 > Score of best tree(s) found = 1383 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),((OGI,OGI),OGI)),GM),(((AGI,AGI),(ST,ST)),PGI)):0.5000; tree PAUP_2 = [&R] ((((GM,MT),((OGI,OGI),OGI)),GM),(((AGI,AGI),PGI),(ST,ST))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:25 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl33346.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1702 total characters: > All characters are of type 'unord' > All characters have equal weight > 981 characters are constant > 235 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 486 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251493 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 116 > Score of best tree(s) found = 1265 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),ST),((LJ,MT),GM)),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:25 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl33795.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 580 total characters: > All characters are of type 'unord' > All characters have equal weight > 307 characters are constant > 66 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 207 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC106685 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 270 > Score of best tree(s) found = 590 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((MT,MT),(GM,GM)),LJ),((OGI,OGI),((AGI,AGI),AGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:26 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl34053.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 882 total characters: > All characters are of type 'unord' > All characters have equal weight > 606 characters are constant > 247 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 29 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC9277 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 4 > Score of best tree(s) found = 324 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((LJ,GM),MT),ST):0.5000; tree PAUP_2 = [&R] (((LJ,MT),GM),ST):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:26 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl34165.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 736 total characters: > All characters are of type 'unord' > All characters have equal weight > 424 characters are constant > 145 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 167 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC260767 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 546 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),((GM,MT),ST)),(GM,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:26 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl34326.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1334 total characters: > All characters are of type 'unord' > All characters have equal weight > 647 characters are constant > 226 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 461 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261553 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 792 > Score of best tree(s) found = 1667 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),(ST,OGI)),(((((LJ,MT),GM),AGI),(ST,ST)),GM)):0.5000; tree PAUP_2 = [&R] (((AGI,AGI),(ST,OGI)),(((((LJ,GM),MT),(ST,ST)),AGI),GM)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:26 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl34400.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 867 total characters: > All characters are of type 'unord' > All characters have equal weight > 599 characters are constant > 218 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 50 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC227860 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 299 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:26 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl34472.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2595 total characters: > All characters are of type 'unord' > All characters have equal weight > 1631 characters are constant > 464 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 500 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC248787 3) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 72 > Score of best tree(s) found = 1635 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (OGI,((ST,(AGI,AGI)),((LJ,GM),MT))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:27 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl34566.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 596 total characters: > All characters are of type 'unord' > All characters have equal weight > 292 characters are constant > 59 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 245 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225497 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1287 > Score of best tree(s) found = 857 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),((OGI,OGI),((PGI,PGI),PGI))),LJ),((((AGI,AGI),AGI),(MT,MT)),((ST,ST),ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:27 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl34705.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1937 total characters: > All characters are of type 'unord' > All characters have equal weight > 1134 characters are constant > 345 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 458 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205131 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 1485 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),(ST,ST)),AGI),(AGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:27 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl35136.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1201 total characters: > All characters are of type 'unord' > All characters have equal weight > 649 characters are constant > 129 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 423 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251704 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 684 > Score of best tree(s) found = 1147 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),AGI),((MT,MT),GM)),(MT,(GM,((LJ,GM),MT)))),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:28 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl35144.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1155 total characters: > All characters are of type 'unord' > All characters have equal weight > 632 characters are constant > 161 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 362 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC262932 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 172 > Score of best tree(s) found = 1193 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((OGI,PGI),(((GM,LJ),MT),((ST,ST),(AGI,AGI)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:28 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl35208.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 888 total characters: > All characters are of type 'unord' > All characters have equal weight > 421 characters are constant > 120 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 347 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC229210 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1537 > Score of best tree(s) found = 1521 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),GM),(((((ST,AGI),AGI),(AGI,AGI)),(GM,(LJ,MT))),(ST,ST))),((OGI,OGI),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:29 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl35380.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2182 total characters: > All characters are of type 'unord' > All characters have equal weight > 1325 characters are constant > 401 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 456 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204625 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 1490 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),OGI),((AGI,AGI),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl35492.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 898 total characters: > All characters are of type 'unord' > All characters have equal weight > 633 characters are constant > 142 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 123 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC113308 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 365 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((ST,ST),ST),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl36000.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 650 total characters: > All characters are of type 'unord' > All characters have equal weight > 293 characters are constant > 81 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 276 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC8962 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2302 > Score of best tree(s) found = 1158 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,ST),((AGI,AGI),AGI)),(((((GM,GM),MT),LJ),MT),MT)),((((OGI,(OGI,OGI)),OGI),OGI),PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl36027.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1723 total characters: > All characters are of type 'unord' > All characters have equal weight > 924 characters are constant > 246 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 553 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC270636 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 302 > Score of best tree(s) found = 1771 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,((LJ,MT),GM)),ST),(((AGI,AGI),(ST,GM)),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl36078.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 774 total characters: > All characters are of type 'unord' > All characters have equal weight > 575 characters are constant > 176 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 23 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC219074 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 225 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl36336.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 747 total characters: > All characters are of type 'unord' > All characters have equal weight > 348 characters are constant > 108 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 291 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC206299 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2696 > Score of best tree(s) found = 955 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((GM,LJ),((PGI,PGI),PGI)),((((((ST,ST),ST),ST),ST),AGI),((GM,((GM,GM),((MT,MT),LJ))),LJ))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl36370.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1130 total characters: > All characters are of type 'unord' > All characters have equal weight > 701 characters are constant > 202 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 227 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216075 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 778 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),(AGI,AGI)),(PGI,PGI)),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl36751.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1207 total characters: > All characters are of type 'unord' > All characters have equal weight > 815 characters are constant > 316 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 76 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC229532 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 494 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),ST),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl36785.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 869 total characters: > All characters are of type 'unord' > All characters have equal weight > 452 characters are constant > 240 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 177 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224645 3) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 130 > Score of best tree(s) found = 718 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),MT),ST),(((PGI,PGI),PGI),PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl36934.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 825 total characters: > All characters are of type 'unord' > All characters have equal weight > 641 characters are constant > 142 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 42 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC8322 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 206 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,(GM,GM)),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37061.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1136 total characters: > All characters are of type 'unord' > All characters have equal weight > 683 characters are constant > 212 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 241 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC7960 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 687 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,GM),MT),((ST,ST),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37086.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 808 total characters: > All characters are of type 'unord' > All characters have equal weight > 462 characters are constant > 214 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 132 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC266155 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 72 > Score of best tree(s) found = 529 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,((LJ,(GM,GM)),MT)),(ST,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37110.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 804 total characters: > All characters are of type 'unord' > All characters have equal weight > 409 characters are constant > 163 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 232 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225469 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1339 > Score of best tree(s) found = 795 > Number of trees retained = 3 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),((GM,MT),LJ)),ST),(AGI,(((OGI,OGI),OGI),OGI))):0.3333; tree PAUP_2 = [&R] ((((GM,MT),((GM,MT),LJ)),ST),(AGI,((OGI,(OGI,OGI)),OGI))):0.3333; tree PAUP_3 = [&R] ((((GM,MT),((GM,MT),LJ)),ST),(AGI,(((OGI,OGI),OGI),OGI))):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37178.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1249 total characters: > All characters are of type 'unord' > All characters have equal weight > 578 characters are constant > 233 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 438 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215292 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 295 > Score of best tree(s) found = 1422 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((GM,(GM,LJ)),MT),(ST,AGI)),AGI),((OGI,OGI),PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37251.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1451 total characters: > All characters are of type 'unord' > All characters have equal weight > 848 characters are constant > 149 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 454 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC254010 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 172 > Score of best tree(s) found = 1231 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),(MT,MT)),(ST,ST)),((OGI,OGI),PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37468.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 704 total characters: > All characters are of type 'unord' > All characters have equal weight > 477 characters are constant > 149 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 78 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC208861 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 311 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),(MT,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37605.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 879 total characters: > All characters are of type 'unord' > All characters have equal weight > 431 characters are constant > 176 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 272 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251354 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 424 > Score of best tree(s) found = 714 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),AGI),((ST,ST),(MT,(((GM,(GM,GM)),GM),LJ)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37653.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1442 total characters: > All characters are of type 'unord' > All characters have equal weight > 969 characters are constant > 336 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 137 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204690 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 673 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),LJ),AGI),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37747.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1205 total characters: > All characters are of type 'unord' > All characters have equal weight > 719 characters are constant > 190 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 296 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214932 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 216 > Score of best tree(s) found = 799 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),(((((MT,MT),MT),LJ),GM),GM)),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37814.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 803 total characters: > All characters are of type 'unord' > All characters have equal weight > 528 characters are constant > 207 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 68 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC127272 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 311 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((ST,ST),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37845.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1563 total characters: > All characters are of type 'unord' > All characters have equal weight > 1072 characters are constant > 420 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 71 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215518 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 591 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),GM),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37881.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 789 total characters: > All characters are of type 'unord' > All characters have equal weight > 472 characters are constant > 171 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 146 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC248402 2) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 529 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((OGI,GM),ST),(GM,GM)),(GM,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37892.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2007 total characters: > All characters are of type 'unord' > All characters have equal weight > 1163 characters are constant > 429 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 415 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261148 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 1437 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),OGI),((GM,LJ),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl37926.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2876 total characters: > All characters are of type 'unord' > All characters have equal weight > 1757 characters are constant > 870 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 249 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC248871 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 1573 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((OGI,OGI),(PGI,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl3799.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1390 total characters: > All characters are of type 'unord' > All characters have equal weight > 1017 characters are constant > 266 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 107 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214050 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 520 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),LJ),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38074.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1409 total characters: > All characters are of type 'unord' > All characters have equal weight > 961 characters are constant > 384 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 64 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203775 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 549 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38106.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 652 total characters: > All characters are of type 'unord' > All characters have equal weight > 447 characters are constant > 162 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 43 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216317 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 24 > Score of best tree(s) found = 266 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),(LJ,MT)),ST):0.5000; tree PAUP_2 = [&R] ((((GM,GM),LJ),MT),ST):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl3812.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 642 total characters: > All characters are of type 'unord' > All characters have equal weight > 406 characters are constant > 156 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 80 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC228160 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 362 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),LJ),PGI),(ST,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38197.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 3314 total characters: > All characters are of type 'unord' > All characters have equal weight > 1952 characters are constant > 495 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 867 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC273377 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1335538 > Score of best tree(s) found = 7930 > Number of trees retained = 5 > Time used = 3 sec (CPU time = 2.66 sec) ] tree PAUP_1 = [&R] (((((((((((AGI,AGI),AGI),AGI),(((AGI,AGI),(AGI,AGI)),AGI)),((((GM,GM),(GM,(GM,GM))),GM),(((((OGI,OGI),OGI),((OGI,OGI),OGI)),((OGI,OGI),OGI)),((PGI,PGI),((PGI,PGI),PGI))))),LJ),ST),(((((AGI,AGI),AGI),AGI),(AGI,AGI)),PGI)),((GM,(GM,GM)),((MT,(MT,LJ)),(MT,MT)))),(ST,ST)),((((((((PGI,PGI),PGI),((((PGI,PGI),PGI),((PGI,(PGI,PGI)),PGI)),PGI)),PGI),((GM,GM),MT)),(((((PGI,PGI),(PGI,PGI)),PGI),((((PGI,(PGI,PGI)),PGI),PGI),(PGI,PGI))),PGI)),((ST,(ST,ST)),((GM,GM),(((MT,MT),MT),MT)))),(((GM,GM),(LJ,LJ)),(((MT,MT),(MT,MT)),LJ)))):0.2000; tree PAUP_2 = [&R] (((((((((((AGI,AGI),AGI),AGI),(((AGI,AGI),(AGI,AGI)),AGI)),((((GM,GM),(GM,(GM,GM))),GM),(((((OGI,OGI),OGI),((OGI,OGI),OGI)),((OGI,OGI),OGI)),((PGI,PGI),((PGI,PGI),PGI))))),LJ),ST),(((((AGI,AGI),AGI),AGI),(AGI,AGI)),PGI)),(GM,((GM,GM),(((MT,(MT,MT)),MT),LJ)))),(ST,ST)),((((((((PGI,PGI),PGI),((((PGI,PGI),PGI),((PGI,(PGI,PGI)),PGI)),PGI)),PGI),((GM,GM),MT)),(((((PGI,PGI),(PGI,PGI)),PGI),((((PGI,(PGI,PGI)),PGI),PGI),(PGI,PGI))),PGI)),((ST,(ST,ST)),((GM,GM),(((MT,MT),MT),MT)))),(((GM,GM),(LJ,LJ)),(((MT,MT),(MT,MT)),LJ)))):0.2000; tree PAUP_3 = [&R] (((((((((((AGI,AGI),AGI),AGI),(((AGI,AGI),(AGI,AGI)),AGI)),((((GM,GM),(GM,(GM,GM))),(((((OGI,OGI),OGI),((OGI,OGI),OGI)),((OGI,OGI),OGI)),((PGI,PGI),((PGI,PGI),PGI)))),GM)),LJ),ST),(((((AGI,AGI),AGI),AGI),(AGI,AGI)),PGI)),((GM,(GM,GM)),((MT,(MT,LJ)),(MT,MT)))),(ST,ST)),((((((((PGI,PGI),PGI),((((PGI,PGI),PGI),((PGI,(PGI,PGI)),PGI)),PGI)),PGI),((GM,GM),MT)),(((((PGI,PGI),(PGI,PGI)),PGI),((((PGI,(PGI,PGI)),PGI),PGI),(PGI,PGI))),PGI)),((ST,(ST,ST)),((GM,GM),(((MT,MT),MT),MT)))),(((GM,GM),(LJ,LJ)),(((MT,MT),(MT,MT)),LJ)))):0.2000; tree PAUP_4 = [&R] ((((((((((AGI,AGI),AGI),AGI),(((AGI,AGI),(AGI,AGI)),AGI)),((((GM,GM),(GM,(GM,GM))),(((((OGI,OGI),OGI),((OGI,OGI),OGI)),((OGI,OGI),OGI)),((PGI,PGI),((PGI,PGI),PGI)))),GM)),LJ),ST),(((((AGI,AGI),AGI),AGI),(AGI,AGI)),PGI)),(GM,((GM,GM),(((MT,(MT,MT)),MT),LJ)))),((ST,ST),((((((((PGI,PGI),PGI),((((PGI,PGI),PGI),((PGI,(PGI,PGI)),PGI)),PGI)),PGI),((GM,GM),MT)),(((((PGI,PGI),(PGI,PGI)),PGI),((((PGI,(PGI,PGI)),PGI),PGI),(PGI,PGI))),PGI)),((ST,(ST,ST)),((GM,GM),(((MT,MT),MT),MT)))),(((GM,GM),(LJ,LJ)),(((MT,MT),(MT,MT)),LJ))))):0.2000; tree PAUP_5 = [&R] (((((((((((AGI,AGI),AGI),AGI),(((AGI,AGI),(AGI,AGI)),AGI)),((((GM,GM),(GM,(GM,GM))),GM),(((((OGI,OGI),OGI),((OGI,OGI),OGI)),((OGI,OGI),OGI)),(((PGI,PGI),PGI),(PGI,PGI))))),LJ),ST),(((((AGI,AGI),AGI),AGI),(AGI,AGI)),PGI)),(GM,((GM,GM),(((MT,(MT,MT)),MT),LJ)))),(ST,ST)),((((((((PGI,PGI),PGI),((((PGI,PGI),PGI),((PGI,(PGI,PGI)),PGI)),PGI)),PGI),((GM,GM),MT)),(((((PGI,PGI),(PGI,PGI)),PGI),((((PGI,(PGI,PGI)),PGI),PGI),(PGI,PGI))),PGI)),((ST,(ST,ST)),((GM,GM),(((MT,MT),MT),MT)))),(((GM,GM),(LJ,LJ)),(((MT,MT),(MT,MT)),LJ)))):0.2000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38260.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 910 total characters: > All characters are of type 'unord' > All characters have equal weight > 518 characters are constant > 208 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 184 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205039 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 244 > Score of best tree(s) found = 631 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,(GM,(LJ,MT))),LJ),MT),(ST,ST)):0.5000; tree PAUP_2 = [&R] ((((GM,LJ),(GM,(LJ,MT))),MT),(ST,ST)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38315.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1200 total characters: > All characters are of type 'unord' > All characters have equal weight > 674 characters are constant > 199 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 327 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251534 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 114 > Score of best tree(s) found = 914 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),((GM,LJ),MT)),((PGI,PGI),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38342.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1461 total characters: > All characters are of type 'unord' > All characters have equal weight > 1168 characters are constant > 229 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 64 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC270688 2) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 368 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,LJ),OGI),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:17 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38403.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1486 total characters: > All characters are of type 'unord' > All characters have equal weight > 845 characters are constant > 112 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 529 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251953 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 754 > Score of best tree(s) found = 1859 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((((AGI,AGI),(ST,ST)),(MT,MT)),GM),GM),LJ),((PGI,PGI),(OGI,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:18 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38418.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 637 total characters: > All characters are of type 'unord' > All characters have equal weight > 373 characters are constant > 183 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 81 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC217737 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 390 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),(PGI,ST)),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:18 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38861.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1080 total characters: > All characters are of type 'unord' > All characters have equal weight > 651 characters are constant > 246 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 183 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC227074 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 576 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),((AGI,AGI),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:18 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38937.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 706 total characters: > All characters are of type 'unord' > All characters have equal weight > 528 characters are constant > 131 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 47 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC220993 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 219 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,MT),((LJ,MT),GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:18 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl38960.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 735 total characters: > All characters are of type 'unord' > All characters have equal weight > 560 characters are constant > 143 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 32 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC8442 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 191 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,(GM,GM)),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:18 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl39175.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1263 total characters: > All characters are of type 'unord' > All characters have equal weight > 739 characters are constant > 255 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 269 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204627 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 766 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),(ST,ST)),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:19 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl39535.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1056 total characters: > All characters are of type 'unord' > All characters have equal weight > 537 characters are constant > 227 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 292 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204659 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 130 > Score of best tree(s) found = 1019 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((GM,(LJ,MT)),GM),AGI),((ST,ST),PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:19 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl39559.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 648 total characters: > All characters are of type 'unord' > All characters have equal weight > 448 characters are constant > 178 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 22 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14899 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 235 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,MT),GM),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:19 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl39646.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2166 total characters: > All characters are of type 'unord' > All characters have equal weight > 1209 characters are constant > 307 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 650 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC257510 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 416 > Score of best tree(s) found = 2059 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),AGI),PGI),(((OGI,ST),(((GM,GM),GM),MT)),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:19 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl39850.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1216 total characters: > All characters are of type 'unord' > All characters have equal weight > 873 characters are constant > 226 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 117 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC206197 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 404 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(MT,LJ)),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:20 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl40066.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1302 total characters: > All characters are of type 'unord' > All characters have equal weight > 1103 characters are constant > 179 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 20 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC8668 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 222 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,MT),(GM,GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:20 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl40080.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 910 total characters: > All characters are of type 'unord' > All characters have equal weight > 678 characters are constant > 200 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 32 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204305 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 288 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),GM),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:20 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl40277.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1364 total characters: > All characters are of type 'unord' > All characters have equal weight > 587 characters are constant > 151 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 626 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC118975 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 31930 > Score of best tree(s) found = 3776 > Number of trees retained = 3 > Time used = <1 sec (CPU time = 0.08 sec) ] tree PAUP_1 = [&R] ((((((ST,ST),(AGI,AGI)),(OGI,(OGI,OGI))),(((MT,MT),LJ),GM)),(((GM,LJ),((GM,GM),GM)),(MT,MT))),(((((((ST,ST),MT),AGI),(PGI,PGI)),(((PGI,PGI),PGI),((PGI,PGI),PGI))),AGI),(ST,ST))):0.3333; tree PAUP_2 = [&R] ((((((ST,ST),(AGI,AGI)),(OGI,(OGI,OGI))),(((MT,MT),LJ),GM)),(((GM,LJ),((GM,GM),GM)),(MT,MT))),(((((((ST,ST),MT),AGI),(PGI,PGI)),(((PGI,PGI),PGI),(PGI,(PGI,PGI)))),AGI),(ST,ST))):0.3333; tree PAUP_3 = [&R] ((((((ST,ST),(AGI,AGI)),(OGI,(OGI,OGI))),(((MT,MT),LJ),GM)),(((GM,LJ),((GM,GM),GM)),(MT,MT))),(((((((ST,ST),MT),AGI),(PGI,PGI)),(((PGI,PGI),PGI),((PGI,PGI),PGI))),AGI),(ST,ST))):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:27 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl40325.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1641 total characters: > All characters are of type 'unord' > All characters have equal weight > 1199 characters are constant > 319 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 123 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224613 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 575 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),AGI),OGI),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:28 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl40637.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 850 total characters: > All characters are of type 'unord' > All characters have equal weight > 384 characters are constant > 100 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 366 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215588 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2710 > Score of best tree(s) found = 1306 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((GM,(GM,LJ)),MT),(MT,ST)),((((GM,LJ),(MT,MT)),(((GM,GM),MT),GM)),ST)):0.5000; tree PAUP_2 = [&R] ((((GM,(GM,LJ)),MT),(MT,ST)),((((GM,LJ),(MT,MT)),(((GM,GM),GM),MT)),ST)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:28 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl40726.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2152 total characters: > All characters are of type 'unord' > All characters have equal weight > 1640 characters are constant > 349 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 163 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC209020 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 596 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,MT),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:28 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl40894.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1171 total characters: > All characters are of type 'unord' > All characters have equal weight > 454 characters are constant > 241 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 476 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205795 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 917 > Score of best tree(s) found = 1792 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((GM,GM),MT),(MT,MT)),LJ),(GM,(((GM,GM),GM),(((MT,MT),MT),MT)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:29 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl40968.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1111 total characters: > All characters are of type 'unord' > All characters have equal weight > 875 characters are constant > 106 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 130 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC262622 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 131 > Score of best tree(s) found = 341 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,((LJ,GM),MT)),ST),OGI),(PGI,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:29 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl41618.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 852 total characters: > All characters are of type 'unord' > All characters have equal weight > 406 characters are constant > 99 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 347 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251855 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 561 > Score of best tree(s) found = 1152 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),((((GM,GM),LJ),MT),LJ)),(((GM,GM),(MT,MT)),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl41691.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 870 total characters: > All characters are of type 'unord' > All characters have equal weight > 438 characters are constant > 114 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 318 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205413 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 674 > Score of best tree(s) found = 1093 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),((PGI,PGI),PGI)),(((GM,MT),LJ),ST)),(((AGI,AGI),OGI),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:30 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl41743.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 722 total characters: > All characters are of type 'unord' > All characters have equal weight > 371 characters are constant > 122 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 229 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = PGI TC68749 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 392 > Score of best tree(s) found = 747 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((PGI,PGI),((OGI,OGI),(OGI,OGI))),((((GM,GM),OGI),AGI),GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl41944.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1769 total characters: > All characters are of type 'unord' > All characters have equal weight > 1122 characters are constant > 496 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 151 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC272039 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 894 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,ST),(OGI,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl41987.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1698 total characters: > All characters are of type 'unord' > All characters have equal weight > 890 characters are constant > 270 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 538 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC249519 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 135 > Score of best tree(s) found = 1706 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((OGI,OGI),OGI),PGI),(((GM,MT),AGI),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:31 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42004.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1631 total characters: > All characters are of type 'unord' > All characters have equal weight > 924 characters are constant > 209 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 498 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215115 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 969 > Score of best tree(s) found = 1874 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((((GM,MT),((GM,LJ),MT)),PGI),ST),(AGI,ST)),((AGI,AGI),(OGI,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42071.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1179 total characters: > All characters are of type 'unord' > All characters have equal weight > 682 characters are constant > 253 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 244 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261601 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 816 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),OGI),((GM,MT),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42327.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 723 total characters: > All characters are of type 'unord' > All characters have equal weight > 370 characters are constant > 109 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 244 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252988 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 290 > Score of best tree(s) found = 750 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),ST),((GM,(LJ,(MT,MT))),GM)),(OGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:32 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42369.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 915 total characters: > All characters are of type 'unord' > All characters have equal weight > 554 characters are constant > 136 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 225 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC263112 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 587 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),(LJ,MT)),(OGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42399.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 803 total characters: > All characters are of type 'unord' > All characters have equal weight > 556 characters are constant > 192 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 55 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214112 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 277 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),MT),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42440.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1786 total characters: > All characters are of type 'unord' > All characters have equal weight > 1193 characters are constant > 437 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 156 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC263722 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 783 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((OGI,OGI),(AGI,GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42477.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1201 total characters: > All characters are of type 'unord' > All characters have equal weight > 700 characters are constant > 220 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 281 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC257718 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 258 > Score of best tree(s) found = 860 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),((ST,ST),((LJ,GM),MT))),((PGI,PGI),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42554.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 746 total characters: > All characters are of type 'unord' > All characters have equal weight > 550 characters are constant > 167 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 29 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225911 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 217 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42625.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1546 total characters: > All characters are of type 'unord' > All characters have equal weight > 823 characters are constant > 140 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 583 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251707 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 625 > Score of best tree(s) found = 2198 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),AGI),(GM,MT)),((((OGI,OGI),(PGI,PGI)),(ST,ST)),(GM,MT))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42881.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 587 total characters: > All characters are of type 'unord' > All characters have equal weight > 353 characters are constant > 110 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 124 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC262967 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 416 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,ST),((GM,GM),MT)),(OGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42924.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 822 total characters: > All characters are of type 'unord' > All characters have equal weight > 495 characters are constant > 273 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 54 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC217212 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 433 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl42984.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 861 total characters: > All characters are of type 'unord' > All characters have equal weight > 423 characters are constant > 88 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 350 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204613 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 344 > Score of best tree(s) found = 1011 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),(MT,LJ)),((ST,ST),(ST,ST))),(AGI,(PGI,PGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl4338.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1674 total characters: > All characters are of type 'unord' > All characters have equal weight > 881 characters are constant > 216 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 577 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251973 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 717 > Score of best tree(s) found = 2072 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),AGI),AGI),(OGI,OGI)),((((GM,(LJ,MT)),GM),MT),(ST,ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl43829.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 842 total characters: > All characters are of type 'unord' > All characters have equal weight > 556 characters are constant > 248 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 38 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC220952 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 338 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),GM),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl43928.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 909 total characters: > All characters are of type 'unord' > All characters have equal weight > 538 characters are constant > 197 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 174 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC208334 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 604 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),(ST,ST)),(GM,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44057.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2431 total characters: > All characters are of type 'unord' > All characters have equal weight > 1689 characters are constant > 659 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 83 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204871 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 839 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44157.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 582 total characters: > All characters are of type 'unord' > All characters have equal weight > 380 characters are constant > 94 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 108 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC217243 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 274 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44339.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 812 total characters: > All characters are of type 'unord' > All characters have equal weight > 651 characters are constant > 140 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 21 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203355 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 189 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,GM),(MT,LJ)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44395.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 719 total characters: > All characters are of type 'unord' > All characters have equal weight > 410 characters are constant > 54 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 255 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224586 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 6333 > Score of best tree(s) found = 1279 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((GM,(GM,(OGI,OGI))),LJ),((((((AGI,AGI),PGI),(AGI,((ST,ST),ST))),(((((GM,LJ),GM),MT),LJ),GM)),MT),MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44659.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 776 total characters: > All characters are of type 'unord' > All characters have equal weight > 588 characters are constant > 155 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 33 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC16978 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 4 > Score of best tree(s) found = 231 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,MT),(GM,GM)):0.5000; tree PAUP_2 = [&R] ((LJ,GM),(MT,GM)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44676.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 741 total characters: > All characters are of type 'unord' > All characters have equal weight > 585 characters are constant > 129 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 27 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215761 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 182 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44677.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 996 total characters: > All characters are of type 'unord' > All characters have equal weight > 631 characters are constant > 233 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 132 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205598 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 540 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,((GM,LJ),MT)),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:37 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl4479.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2637 total characters: > All characters are of type 'unord' > All characters have equal weight > 1572 characters are constant > 337 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 728 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC262269 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 133 > Score of best tree(s) found = 2327 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((OGI,OGI),PGI),GM),(((AGI,AGI),AGI),MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44840.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1432 total characters: > All characters are of type 'unord' > All characters have equal weight > 672 characters are constant > 150 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 610 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC119696 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 3085 > Score of best tree(s) found = 2816 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.02 sec) ] tree PAUP_1 = [&R] ((((ST,ST),AGI),(PGI,(PGI,PGI))),((((AGI,AGI),(((GM,GM),MT),((MT,GM),MT))),ST),(((OGI,OGI),OGI),OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:40 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl44862.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1299 total characters: > All characters are of type 'unord' > All characters have equal weight > 706 characters are constant > 202 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 391 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC125968 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 548 > Score of best tree(s) found = 1185 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((ST,ST),ST),OGI),(((GM,MT),GM),((AGI,AGI),AGI))):0.5000; tree PAUP_2 = [&R] ((((ST,ST),ST),((GM,MT),GM)),(OGI,((AGI,AGI),AGI))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:40 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl45129.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 817 total characters: > All characters are of type 'unord' > All characters have equal weight > 556 characters are constant > 203 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 58 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC119860 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 302 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((ST,ST),MT),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:41 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl45248.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 739 total characters: > All characters are of type 'unord' > All characters have equal weight > 322 characters are constant > 55 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 362 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225596 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 9859 > Score of best tree(s) found = 1895 > Number of trees retained = 2 > Time used = 1 sec (CPU time = 0.03 sec) ] tree PAUP_1 = [&R] (((((GM,MT),(GM,LJ)),((PGI,PGI),PGI)),((((GM,GM),LJ),MT),MT)),(((((AGI,AGI),AGI),AGI),(ST,ST)),(((OGI,OGI),OGI),(ST,ST)))):0.5000; tree PAUP_2 = [&R] ((((GM,MT),(GM,LJ)),(((((GM,GM),LJ),MT),MT),((PGI,PGI),PGI))),(((((AGI,AGI),AGI),AGI),(ST,ST)),(((OGI,OGI),OGI),(ST,ST)))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl45273.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1249 total characters: > All characters are of type 'unord' > All characters have equal weight > 969 characters are constant > 246 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 34 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215322 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 333 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl45403.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1652 total characters: > All characters are of type 'unord' > All characters have equal weight > 1082 characters are constant > 475 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 95 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251518 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 756 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,(ST,MT)),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl45411.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 814 total characters: > All characters are of type 'unord' > All characters have equal weight > 497 characters are constant > 158 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 159 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204519 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 521 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),(GM,LJ)),MT),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl46102.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 852 total characters: > All characters are of type 'unord' > All characters have equal weight > 513 characters are constant > 269 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 70 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261018 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 474 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,ST),ST),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl46104.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1601 total characters: > All characters are of type 'unord' > All characters have equal weight > 1032 characters are constant > 457 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 112 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC227064 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 738 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl46124.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1096 total characters: > All characters are of type 'unord' > All characters have equal weight > 597 characters are constant > 254 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 245 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC7986 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 780 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,GM),MT),ST),(OGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl46126.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1274 total characters: > All characters are of type 'unord' > All characters have equal weight > 677 characters are constant > 127 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 470 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC274163 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 741 > Score of best tree(s) found = 1511 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,ST),(PGI,PGI)),(((OGI,OGI),AGI),(((GM,LJ),MT),ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl46149.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1163 total characters: > All characters are of type 'unord' > All characters have equal weight > 730 characters are constant > 206 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 227 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC7844 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 674 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,MT),GM),GM),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl46201.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 776 total characters: > All characters are of type 'unord' > All characters have equal weight > 492 characters are constant > 121 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 163 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC262486 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 109 > Score of best tree(s) found = 524 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),((LJ,MT),(GM,GM))),(ST,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl46304.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 997 total characters: > All characters are of type 'unord' > All characters have equal weight > 429 characters are constant > 156 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 412 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225028 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 17615 > Score of best tree(s) found = 1944 > Number of trees retained = 5 > Time used = <1 sec (CPU time = 0.04 sec) ] tree PAUP_1 = [&R] (((((((GM,GM),LJ),MT),MT),GM),((ST,ST),ST)),(((((AGI,AGI),AGI),(AGI,AGI)),AGI),(((ST,ST),ST),((GM,LJ),(GM,MT))))):0.2000; tree PAUP_2 = [&R] (((((((GM,GM),LJ),MT),MT),GM),((ST,ST),ST)),(((((AGI,AGI),AGI),(AGI,AGI)),AGI),(((ST,ST),ST),(((GM,LJ),MT),GM)))):0.2000; tree PAUP_3 = [&R] (((((((GM,GM),LJ),MT),MT),GM),((ST,ST),ST)),(((((AGI,AGI),AGI),(AGI,AGI)),AGI),(((ST,ST),ST),(((GM,LJ),GM),MT)))):0.2000; tree PAUP_4 = [&R] (((((((GM,GM),LJ),MT),MT),GM),(ST,(ST,ST))),(((((AGI,AGI),AGI),(AGI,AGI)),AGI),(((ST,ST),ST),((GM,LJ),(GM,MT))))):0.2000; tree PAUP_5 = [&R] ((((((GM,GM),LJ),GM),(MT,MT)),((ST,ST),ST)),(((((AGI,AGI),AGI),(AGI,AGI)),AGI),(((ST,ST),ST),((GM,LJ),(GM,MT))))):0.2000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:46 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl46402.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1203 total characters: > All characters are of type 'unord' > All characters have equal weight > 757 characters are constant > 145 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 301 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC8523 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 324 > Score of best tree(s) found = 811 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((LJ,MT),GM),((AGI,AGI),AGI)),((GM,MT),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:47 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl4692.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 753 total characters: > All characters are of type 'unord' > All characters have equal weight > 531 characters are constant > 168 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 54 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC270712 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 275 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,ST),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:47 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl47018.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 834 total characters: > All characters are of type 'unord' > All characters have equal weight > 330 characters are constant > 147 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 357 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252779 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 5618 > Score of best tree(s) found = 1474 > Number of trees retained = 4 > Time used = <1 sec (CPU time = 0.02 sec) ] tree PAUP_1 = [&R] ((((AGI,ST),(GM,MT)),(PGI,PGI)),(((AGI,AGI),(ST,(((GM,GM),LJ),MT))),((OGI,OGI),OGI))):0.2500; tree PAUP_2 = [&R] ((((AGI,ST),(GM,MT)),(PGI,PGI)),(((AGI,AGI),(ST,(((GM,GM),LJ),MT))),((OGI,OGI),OGI))):0.2500; tree PAUP_3 = [&R] ((((AGI,ST),(GM,MT)),(PGI,PGI)),(((AGI,AGI),(ST,((GM,GM),(LJ,MT)))),((OGI,OGI),OGI))):0.2500; tree PAUP_4 = [&R] ((((AGI,ST),(GM,MT)),(PGI,PGI)),(((AGI,AGI),(ST,((GM,GM),(LJ,MT)))),((OGI,OGI),OGI))):0.2500; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl47384.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 869 total characters: > All characters are of type 'unord' > All characters have equal weight > 640 characters are constant > 206 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 23 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225183 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 266 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl47473.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1229 total characters: > All characters are of type 'unord' > All characters have equal weight > 737 characters are constant > 412 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 80 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226687 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 620 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),AGI),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl4751.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1254 total characters: > All characters are of type 'unord' > All characters have equal weight > 707 characters are constant > 288 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 259 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14667 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 839 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,MT),GM),ST),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl47556.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1153 total characters: > All characters are of type 'unord' > All characters have equal weight > 644 characters are constant > 147 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 362 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC273350 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 274 > Score of best tree(s) found = 1168 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),AGI),AGI),((GM,MT),MT)),(ST,(PGI,PGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl47581.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 983 total characters: > All characters are of type 'unord' > All characters have equal weight > 753 characters are constant > 160 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 70 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC207896 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 264 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl47586.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1142 total characters: > All characters are of type 'unord' > All characters have equal weight > 735 characters are constant > 228 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 179 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226846 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 588 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),(AGI,AGI)),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:48 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl47633.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1012 total characters: > All characters are of type 'unord' > All characters have equal weight > 466 characters are constant > 117 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 429 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC100653 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2210 > Score of best tree(s) found = 1645 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((((MT,MT),MT),GM),(ST,ST)),(AGI,(((OGI,OGI),OGI),OGI))),(((PGI,PGI),PGI),((((LJ,MT),GM),ST),OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:50 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl47952.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1423 total characters: > All characters are of type 'unord' > All characters have equal weight > 784 characters are constant > 252 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 387 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251365 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 336 > Score of best tree(s) found = 1278 > Number of trees retained = 5 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,MT),(OGI,OGI)),(ST,(GM,PGI))):0.2000; tree PAUP_2 = [&R] (((AGI,(OGI,OGI)),MT),(ST,(GM,PGI))):0.2000; tree PAUP_3 = [&R] ((((AGI,MT),ST),(OGI,OGI)),(GM,PGI)):0.2000; tree PAUP_4 = [&R] (((AGI,MT),ST),(((OGI,OGI),PGI),GM)):0.2000; tree PAUP_5 = [&R] ((((AGI,ST),MT),(OGI,OGI)),(GM,PGI)):0.2000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:50 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl48472.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 724 total characters: > All characters are of type 'unord' > All characters have equal weight > 510 characters are constant > 179 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 35 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215470 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 258 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:50 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl4901.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1338 total characters: > All characters are of type 'unord' > All characters have equal weight > 801 characters are constant > 336 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 201 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225751 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 725 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),(ST,ST)),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:50 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl4916.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 813 total characters: > All characters are of type 'unord' > All characters have equal weight > 487 characters are constant > 110 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 216 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC106814 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 114 > Score of best tree(s) found = 465 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((MT,MT),MT),((GM,GM),LJ)),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:50 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl49229.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1509 total characters: > All characters are of type 'unord' > All characters have equal weight > 954 characters are constant > 451 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 104 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC94414 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 757 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((MT,AGI),(ST,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:50 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl49353.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 666 total characters: > All characters are of type 'unord' > All characters have equal weight > 497 characters are constant > 87 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 82 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225660 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 199 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),(MT,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:50 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl49355.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1463 total characters: > All characters are of type 'unord' > All characters have equal weight > 809 characters are constant > 189 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 465 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203932 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 7214 > Score of best tree(s) found = 2026 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((GM,GM),((MT,MT),MT)),((((((AGI,AGI),AGI),((((ST,ST),(ST,ST)),ST),ST)),(((OGI,OGI),OGI),LJ)),(PGI,PGI)),((GM,MT),(LJ,LJ)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:53 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl49810.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 678 total characters: > All characters are of type 'unord' > All characters have equal weight > 402 characters are constant > 159 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 117 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = PGI TC75278 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 442 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((PGI,ST),(AGI,(GM,(LJ,MT)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:53 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl4985.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 720 total characters: > All characters are of type 'unord' > All characters have equal weight > 454 characters are constant > 200 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 66 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC207350 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 14 > Score of best tree(s) found = 366 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),LJ),MT),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:59:53 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles1/cl49970.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2361 total characters: > All characters are of type 'unord' > All characters have equal weight > 1386 characters are constant > 428 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 547 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252149 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 1605 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),((ST,ST),(MT,MT))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5037.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 932 total characters: > All characters are of type 'unord' > All characters have equal weight > 595 characters are constant > 196 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 141 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214867 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 514 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),GM),GM),(MT,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl50599.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1891 total characters: > All characters are of type 'unord' > All characters have equal weight > 1246 characters are constant > 331 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 314 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251908 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 37 > Score of best tree(s) found = 1091 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),LJ),ST),(OGI,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl50793.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 825 total characters: > All characters are of type 'unord' > All characters have equal weight > 544 characters are constant > 196 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 85 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC217375 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 387 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),(GM,LJ)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5080.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 932 total characters: > All characters are of type 'unord' > All characters have equal weight > 584 characters are constant > 165 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 183 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205084 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 505 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),MT),ST),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl50871.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 806 total characters: > All characters are of type 'unord' > All characters have equal weight > 498 characters are constant > 199 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 109 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226231 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 72 > Score of best tree(s) found = 478 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((GM,MT),LJ),GM),MT),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl50895.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 638 total characters: > All characters are of type 'unord' > All characters have equal weight > 481 characters are constant > 131 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 26 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252450 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 193 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,ST),LJ),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl51107.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 849 total characters: > All characters are of type 'unord' > All characters have equal weight > 674 characters are constant > 150 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 25 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214065 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 205 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:33 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl51347.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1471 total characters: > All characters are of type 'unord' > All characters have equal weight > 949 characters are constant > 285 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 237 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204223 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 724 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),ST),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl51366.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 738 total characters: > All characters are of type 'unord' > All characters have equal weight > 461 characters are constant > 229 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 48 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = PGI TC66256 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 354 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (PGI,(ST,(AGI,GM))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl51397.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1002 total characters: > All characters are of type 'unord' > All characters have equal weight > 676 characters are constant > 283 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 43 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14302 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 395 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,MT),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:34 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl51473.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 801 total characters: > All characters are of type 'unord' > All characters have equal weight > 401 characters are constant > 70 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 330 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261099 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2652 > Score of best tree(s) found = 1416 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((((AGI,AGI),AGI),(PGI,PGI)),((OGI,OGI),(OGI,OGI))),((ST,ST),ST)),GM),((((GM,GM),(MT,(MT,MT))),LJ),GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl51594.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1252 total characters: > All characters are of type 'unord' > All characters have equal weight > 848 characters are constant > 338 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 66 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC7934 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 513 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,MT),GM),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl52038.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1449 total characters: > All characters are of type 'unord' > All characters have equal weight > 929 characters are constant > 423 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 97 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC217724 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 683 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),AGI),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl52044.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 930 total characters: > All characters are of type 'unord' > All characters have equal weight > 641 characters are constant > 195 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 94 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC217971 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 378 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,(GM,MT)),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl52529.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 769 total characters: > All characters are of type 'unord' > All characters have equal weight > 549 characters are constant > 73 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 147 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251479 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 118 > Score of best tree(s) found = 427 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,MT),LJ),(ST,((OGI,OGI),(GM,GM)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl52687.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1096 total characters: > All characters are of type 'unord' > All characters have equal weight > 702 characters are constant > 252 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 142 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC10068 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 36 > Score of best tree(s) found = 519 > Number of trees retained = 3 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((LJ,MT),GM),(ST,ST)):0.3333; tree PAUP_2 = [&R] ((LJ,(MT,GM)),(ST,ST)):0.3333; tree PAUP_3 = [&R] (((LJ,GM),MT),(ST,ST)):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl52697.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 906 total characters: > All characters are of type 'unord' > All characters have equal weight > 615 characters are constant > 227 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 64 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC106916 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 346 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((MT,MT),GM),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl53134.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 734 total characters: > All characters are of type 'unord' > All characters have equal weight > 539 characters are constant > 157 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 38 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204183 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 243 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:35 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5313.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1227 total characters: > All characters are of type 'unord' > All characters have equal weight > 905 characters are constant > 278 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 44 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225577 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 380 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,MT),(GM,LJ)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5319.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 745 total characters: > All characters are of type 'unord' > All characters have equal weight > 511 characters are constant > 187 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 47 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC9089 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 296 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,MT),GM),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl53219.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 594 total characters: > All characters are of type 'unord' > All characters have equal weight > 300 characters are constant > 63 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 231 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC10339 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 1697 > Score of best tree(s) found = 797 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,(((ST,ST),ST),(OGI,OGI))),(MT,(((AGI,AGI),(MT,MT)),((GM,GM),(GM,GM))))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl53234.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1412 total characters: > All characters are of type 'unord' > All characters have equal weight > 936 characters are constant > 309 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 167 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205368 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 633 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),MT),ST),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl54044.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 667 total characters: > All characters are of type 'unord' > All characters have equal weight > 407 characters are constant > 173 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 87 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225830 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 336 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),LJ),MT),(MT,GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:36 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl54050.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 867 total characters: > All characters are of type 'unord' > All characters have equal weight > 437 characters are constant > 111 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 319 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC261012 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 3900 > Score of best tree(s) found = 1395 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),AGI),(PGI,PGI)),(OGI,OGI)),(((((LJ,MT),GM),((GM,GM),LJ)),(((LJ,MT),GM),GM)),((ST,ST),(ST,ST)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl54189.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1097 total characters: > All characters are of type 'unord' > All characters have equal weight > 746 characters are constant > 272 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 79 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214928 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 443 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((GM,GM),LJ),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl54276.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1107 total characters: > All characters are of type 'unord' > All characters have equal weight > 766 characters are constant > 259 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 82 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC95075 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 412 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((MT,MT),(GM,MT)),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5432.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 758 total characters: > All characters are of type 'unord' > All characters have equal weight > 459 characters are constant > 156 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 143 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204181 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 275 > Score of best tree(s) found = 562 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((GM,GM),OGI),((((PGI,GM),OGI),PGI),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5441.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 832 total characters: > All characters are of type 'unord' > All characters have equal weight > 461 characters are constant > 220 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 151 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203377 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 502 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),MT),(ST,ST)),GM):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl54495.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1763 total characters: > All characters are of type 'unord' > All characters have equal weight > 1231 characters are constant > 480 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 52 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226421 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 641 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),MT),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:38 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl54634.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 595 total characters: > All characters are of type 'unord' > All characters have equal weight > 295 characters are constant > 85 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 215 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216625 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 653 > Score of best tree(s) found = 743 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((GM,MT),MT),ST),(((AGI,AGI),ST),AGI)),(OGI,OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl54711.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 995 total characters: > All characters are of type 'unord' > All characters have equal weight > 557 characters are constant > 272 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 166 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC7925 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 36 > Score of best tree(s) found = 703 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((LJ,MT),GM),AGI),ST),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5474.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 564 total characters: > All characters are of type 'unord' > All characters have equal weight > 271 characters are constant > 58 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 235 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251569 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 683 > Score of best tree(s) found = 847 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),(((GM,GM),LJ),(GM,MT))),(PGI,(((ST,ST),ST),(OGI,OGI)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl54941.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1445 total characters: > All characters are of type 'unord' > All characters have equal weight > 972 characters are constant > 375 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 98 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214975 2) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 607 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),AGI),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl55610.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1623 total characters: > All characters are of type 'unord' > All characters have equal weight > 984 characters are constant > 393 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 246 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC271177 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 1039 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,PGI),(OGI,(GM,ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl55673.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1462 total characters: > All characters are of type 'unord' > All characters have equal weight > 943 characters are constant > 338 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 181 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC222676 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 32 > Score of best tree(s) found = 718 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),(MT,MT)),MT),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl55693.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1313 total characters: > All characters are of type 'unord' > All characters have equal weight > 640 characters are constant > 246 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 427 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC100506 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2648 > Score of best tree(s) found = 1362 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] ((((MT,MT),(MT,((MT,MT),MT))),(((((MT,MT),MT),MT),MT),MT)),(LJ,(((GM,GM),GM),(GM,GM)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:41 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl56100.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 780 total characters: > All characters are of type 'unord' > All characters have equal weight > 440 characters are constant > 175 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 165 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC15729 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 542 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((LJ,GM),MT),((ST,ST),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:41 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5625.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 658 total characters: > All characters are of type 'unord' > All characters have equal weight > 306 characters are constant > 73 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 279 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251924 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 10111 > Score of best tree(s) found = 1371 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.02 sec) ] tree PAUP_1 = [&R] ((((((AGI,AGI),AGI),(ST,(GM,ST))),(MT,MT)),((GM,GM),((PGI,PGI),((AGI,AGI),AGI)))),((((OGI,OGI),OGI),OGI),LJ)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:42 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl56347.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1272 total characters: > All characters are of type 'unord' > All characters have equal weight > 925 characters are constant > 266 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 81 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC214859 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 418 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:42 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl56457.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 813 total characters: > All characters are of type 'unord' > All characters have equal weight > 633 characters are constant > 157 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 23 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204448 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 200 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:42 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl56585.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 806 total characters: > All characters are of type 'unord' > All characters have equal weight > 629 characters are constant > 154 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 23 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC206556 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 209 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),GM),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl56685.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 718 total characters: > All characters are of type 'unord' > All characters have equal weight > 447 characters are constant > 179 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 92 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC208517 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 388 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),AGI),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl56698.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 912 total characters: > All characters are of type 'unord' > All characters have equal weight > 407 characters are constant > 146 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 359 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204760 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 518 > Score of best tree(s) found = 1140 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),MT),(AGI,(((GM,LJ),MT),MT))),((GM,MT),(ST,ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl56902.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 977 total characters: > All characters are of type 'unord' > All characters have equal weight > 555 characters are constant > 119 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 303 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC8073 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 306 > Score of best tree(s) found = 767 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((LJ,MT),LJ),GM),LJ),(((ST,ST),ST),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:43 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl57117.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 802 total characters: > All characters are of type 'unord' > All characters have equal weight > 524 characters are constant > 189 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 89 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224723 3) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 349 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),MT),MT),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:44 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl57665.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 876 total characters: > All characters are of type 'unord' > All characters have equal weight > 369 characters are constant > 182 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 325 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251411 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 116683 > Score of best tree(s) found = 2365 > Number of trees retained = 3 > Time used = 1 sec (CPU time = 0.17 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),(ST,ST)),((((OGI,OGI),(OGI,OGI)),(OGI,OGI)),OGI)),(MT,(((LJ,MT),GM),(GM,GM)))),(((((ST,(ST,ST)),(ST,ST)),((PGI,(PGI,PGI)),PGI)),GM),(((AGI,AGI),AGI),((((GM,(LJ,(MT,MT))),GM),(((ST,ST),ST),ST)),((((GM,GM),LJ),MT),AGI))))):0.3333; tree PAUP_2 = [&R] (((((AGI,AGI),(ST,ST)),((((OGI,OGI),(OGI,OGI)),(OGI,OGI)),OGI)),(MT,(((LJ,MT),GM),(GM,GM)))),(((((ST,(ST,ST)),(ST,ST)),((PGI,(PGI,PGI)),PGI)),GM),((AGI,AGI),(AGI,((((GM,(LJ,(MT,MT))),GM),(((ST,ST),ST),ST)),((((GM,GM),LJ),MT),AGI)))))):0.3333; tree PAUP_3 = [&R] (((((AGI,AGI),(ST,ST)),((((OGI,OGI),(OGI,OGI)),(OGI,OGI)),OGI)),(MT,(((LJ,MT),GM),(GM,GM)))),(((((ST,(ST,ST)),(ST,ST)),((PGI,(PGI,PGI)),PGI)),GM),(((AGI,AGI),AGI),((((GM,(LJ,(MT,MT))),GM),(((ST,ST),ST),ST)),((((GM,GM),MT),LJ),AGI))))):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:54 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl57723.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 644 total characters: > All characters are of type 'unord' > All characters have equal weight > 371 characters are constant > 114 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 159 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224550 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 250 > Score of best tree(s) found = 547 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),(GM,LJ)),OGI),(ST,(PGI,PGI))):0.5000; tree PAUP_2 = [&R] (((((GM,MT),GM),LJ),OGI),(ST,(PGI,PGI))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:54 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl57821.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 616 total characters: > All characters are of type 'unord' > All characters have equal weight > 302 characters are constant > 65 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 249 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC94097 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2240 > Score of best tree(s) found = 1082 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((MT,((ST,(ST,ST)),(AGI,(ST,ST)))),((((GM,LJ),((OGI,OGI),OGI)),((GM,GM),LJ)),PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:55 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl57902.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1697 total characters: > All characters are of type 'unord' > All characters have equal weight > 1014 characters are constant > 351 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 332 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC224599 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 1048 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),MT),((AGI,AGI),ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:55 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl58203.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1256 total characters: > All characters are of type 'unord' > All characters have equal weight > 793 characters are constant > 175 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 288 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225977 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 641 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,((GM,MT),MT)),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:55 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl58248.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2277 total characters: > All characters are of type 'unord' > All characters have equal weight > 1505 characters are constant > 605 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 167 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC270747 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 996 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),ST),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:55:56 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl58475.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2069 total characters: > All characters are of type 'unord' > All characters have equal weight > 968 characters are constant > 152 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 949 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251840 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 11290 > Score of best tree(s) found = 6101 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.05 sec) ] tree PAUP_1 = [&R] (((((AGI,AGI),AGI),AGI),(AGI,(((ST,ST),((((MT,MT),GM),ST),(ST,ST))),((((((GM,GM),MT),LJ),GM),LJ),((OGI,OGI),OGI))))),(MT,((ST,(((MT,GM),ST),PGI)),(PGI,PGI)))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl58588.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1439 total characters: > All characters are of type 'unord' > All characters have equal weight > 1109 characters are constant > 274 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 56 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC95532 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 392 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((MT,GM),ST),OGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl58730.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1338 total characters: > All characters are of type 'unord' > All characters have equal weight > 774 characters are constant > 232 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 332 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC267797 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 136 > Score of best tree(s) found = 1012 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),OGI),(((GM,MT),MT),ST)):0.5000; tree PAUP_2 = [&R] (((AGI,AGI),((GM,MT),MT)),(ST,OGI)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl59061.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 934 total characters: > All characters are of type 'unord' > All characters have equal weight > 706 characters are constant > 184 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 44 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC94768 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 272 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((MT,MT),GM),GM),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl59229.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1226 total characters: > All characters are of type 'unord' > All characters have equal weight > 656 characters are constant > 202 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 368 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251740 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 190 > Score of best tree(s) found = 1126 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),ST),((((LJ,MT),GM),GM),(OGI,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:06 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl59232.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1149 total characters: > All characters are of type 'unord' > All characters have equal weight > 616 characters are constant > 233 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 300 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC112907 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 73 > Score of best tree(s) found = 983 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((ST,(ST,(GM,MT))),((GM,MT),AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl59445.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1593 total characters: > All characters are of type 'unord' > All characters have equal weight > 1004 characters are constant > 453 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 136 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC98017 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 825 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((MT,MT),(ST,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl59578.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1322 total characters: > All characters are of type 'unord' > All characters have equal weight > 709 characters are constant > 216 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 397 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251321 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 188 > Score of best tree(s) found = 1284 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),(((GM,MT),LJ),MT)),((ST,ST),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:07 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl59587.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 792 total characters: > All characters are of type 'unord' > All characters have equal weight > 331 characters are constant > 141 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 320 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC208687 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 15653 > Score of best tree(s) found = 1223 > Number of trees retained = 7 > Time used = <1 sec (CPU time = 0.03 sec) ] tree PAUP_1 = [&R] (((GM,GM),(((GM,GM),((GM,GM),GM)),(LJ,(((MT,MT),MT),MT)))),(MT,(((MT,MT),((MT,MT),MT)),MT))):0.1429; tree PAUP_2 = [&R] (((GM,GM),(((GM,GM),((GM,GM),GM)),(LJ,(((MT,MT),MT),MT)))),(MT,(((MT,((MT,MT),MT)),MT),MT))):0.1429; tree PAUP_3 = [&R] (((GM,GM),(((GM,GM),((GM,GM),GM)),(LJ,(((MT,MT),MT),MT)))),(MT,(((MT,((MT,MT),MT)),MT),MT))):0.1429; tree PAUP_4 = [&R] (((GM,GM),(((GM,GM),((GM,GM),GM)),(LJ,(((MT,MT),MT),MT)))),(MT,(((MT,MT),((MT,MT),MT)),MT))):0.1429; tree PAUP_5 = [&R] (((((GM,GM),MT),((GM,GM),((GM,GM),GM))),LJ),((((MT,MT),MT),MT),((MT,(MT,MT)),((MT,MT),MT)))):0.1429; tree PAUP_6 = [&R] (((((GM,GM),MT),LJ),((GM,GM),((GM,GM),GM))),((((MT,MT),MT),MT),((MT,(MT,MT)),((MT,MT),MT)))):0.1429; tree PAUP_7 = [&R] (((((GM,GM),MT),(((GM,GM),((GM,GM),GM)),LJ)),(((MT,MT),MT),MT)),((MT,(MT,MT)),((MT,MT),MT))):0.1429; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl5967.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1132 total characters: > All characters are of type 'unord' > All characters have equal weight > 771 characters are constant > 241 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 120 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC217118 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 525 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),AGI),(ST,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl59845.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1075 total characters: > All characters are of type 'unord' > All characters have equal weight > 725 characters are constant > 302 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 48 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC94345 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 428 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((MT,MT),(GM,LJ)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl60101.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1012 total characters: > All characters are of type 'unord' > All characters have equal weight > 640 characters are constant > 294 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 78 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC216003 2) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 493 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,MT),AGI),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl60159.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1412 total characters: > All characters are of type 'unord' > All characters have equal weight > 940 characters are constant > 343 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 129 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = ST TC112545 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 564 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((ST,ST),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl60613.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 546 total characters: > All characters are of type 'unord' > All characters have equal weight > 358 characters are constant > 149 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 39 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC258757 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 253 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,ST),MT),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:08 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl60632.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2652 total characters: > All characters are of type 'unord' > All characters have equal weight > 1542 characters are constant > 345 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 765 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204391 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 416 > Score of best tree(s) found = 2687 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.01 sec) ] tree PAUP_1 = [&R] (((GM,(LJ,(MT,MT))),MT),((AGI,ST),(((OGI,OGI),OGI),PGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:09 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl60655.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1453 total characters: > All characters are of type 'unord' > All characters have equal weight > 810 characters are constant > 367 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 276 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204869 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 170 > Score of best tree(s) found = 1005 > Number of trees retained = 5 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,MT),LJ),AGI),(ST,ST)):0.2000; tree PAUP_2 = [&R] (((GM,(MT,LJ)),AGI),(ST,ST)):0.2000; tree PAUP_3 = [&R] ((((GM,MT),LJ),(AGI,ST)),ST):0.2000; tree PAUP_4 = [&R] ((((GM,MT),LJ),ST),(AGI,ST)):0.2000; tree PAUP_5 = [&R] (((GM,(MT,LJ)),(AGI,ST)),ST):0.2000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:09 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl60723.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 765 total characters: > All characters are of type 'unord' > All characters have equal weight > 531 characters are constant > 184 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 50 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC256322 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 310 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,(GM,MT)),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:09 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl60845.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 562 total characters: > All characters are of type 'unord' > All characters have equal weight > 331 characters are constant > 136 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 95 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225804 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 335 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,GM),OGI),(ST,PGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:09 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl61104.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 950 total characters: > All characters are of type 'unord' > All characters have equal weight > 640 characters are constant > 207 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 103 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203612 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 24 > Score of best tree(s) found = 441 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,(GM,LJ)),MT),AGI):0.5000; tree PAUP_2 = [&R] ((((GM,GM),LJ),MT),AGI):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl61337.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 573 total characters: > All characters are of type 'unord' > All characters have equal weight > 398 characters are constant > 150 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 25 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205285 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 4 > Score of best tree(s) found = 221 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),AGI):0.5000; tree PAUP_2 = [&R] (((GM,MT),LJ),AGI):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl62270.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 717 total characters: > All characters are of type 'unord' > All characters have equal weight > 522 characters are constant > 117 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 78 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC14830 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 98 > Score of best tree(s) found = 237 > Number of trees retained = 3 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,(MT,(GM,GM))),(GM,GM)):0.3333; tree PAUP_2 = [&R] (((LJ,(GM,GM)),MT),(GM,GM)):0.3333; tree PAUP_3 = [&R] (((LJ,MT),(GM,GM)),(GM,GM)):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl62326.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 715 total characters: > All characters are of type 'unord' > All characters have equal weight > 541 characters are constant > 157 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 17 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC208002 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 202 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),GM):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl62525.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 648 total characters: > All characters are of type 'unord' > All characters have equal weight > 387 characters are constant > 78 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 183 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251653 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 302 > Score of best tree(s) found = 620 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),(GM,MT)),ST),((((GM,LJ),LJ),ST),OGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl62564.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 745 total characters: > All characters are of type 'unord' > All characters have equal weight > 652 characters are constant > 69 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 24 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC101794 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 98 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((MT,MT),GM),LJ):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl62616.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 856 total characters: > All characters are of type 'unord' > All characters have equal weight > 634 characters are constant > 191 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 31 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC203950 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 262 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,MT),(LJ,GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl62828.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 2332 total characters: > All characters are of type 'unord' > All characters have equal weight > 1833 characters are constant > 406 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 93 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC12698 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 594 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,LJ),(GM,MT)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl62834.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 637 total characters: > All characters are of type 'unord' > All characters have equal weight > 317 characters are constant > 98 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 222 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC253195 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 232 > Score of best tree(s) found = 676 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((AGI,AGI),(GM,MT)),ST),((OGI,OGI),PGI)):0.5000; tree PAUP_2 = [&R] (((AGI,AGI),((GM,MT),ST)),((OGI,OGI),PGI)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl62957.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 605 total characters: > All characters are of type 'unord' > All characters have equal weight > 351 characters are constant > 181 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 73 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204342 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 368 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),GM),LJ),AGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl63006.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1625 total characters: > All characters are of type 'unord' > All characters have equal weight > 1087 characters are constant > 460 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 78 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC205729 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 685 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((GM,LJ),MT),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:10 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl63120.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 943 total characters: > All characters are of type 'unord' > All characters have equal weight > 507 characters are constant > 188 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 248 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC226037 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 64 > Score of best tree(s) found = 733 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,LJ),MT),(AGI,AGI)),(ST,ST)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl6328.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1112 total characters: > All characters are of type 'unord' > All characters have equal weight > 709 characters are constant > 215 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 188 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC254280 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 592 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((AGI,AGI),((MT,MT),(GM,LJ))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl63813.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 714 total characters: > All characters are of type 'unord' > All characters have equal weight > 559 characters are constant > 119 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 36 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC9344 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 161 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((LJ,MT),(GM,GM)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl63998.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 817 total characters: > All characters are of type 'unord' > All characters have equal weight > 479 characters are constant > 126 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 212 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC106914 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 118 > Score of best tree(s) found = 522 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((MT,MT),MT),(((GM,GM),LJ),(GM,GM))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64008.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1939 total characters: > All characters are of type 'unord' > All characters have equal weight > 1158 characters are constant > 388 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 393 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC251729 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 34 > Score of best tree(s) found = 1223 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),AGI),(MT,(ST,OGI))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64082.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1492 total characters: > All characters are of type 'unord' > All characters have equal weight > 1009 characters are constant > 349 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 134 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225397 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 582 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((GM,MT),(AGI,AGI)):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64275.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1275 total characters: > All characters are of type 'unord' > All characters have equal weight > 671 characters are constant > 261 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 343 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC252211 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 144 > Score of best tree(s) found = 1106 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,AGI),ST),(((GM,MT),GM),ST)):0.5000; tree PAUP_2 = [&R] (((AGI,AGI),ST),(((GM,MT),GM),ST)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64305.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 861 total characters: > All characters are of type 'unord' > All characters have equal weight > 638 characters are constant > 177 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 46 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC225389 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 30 > Score of best tree(s) found = 263 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((GM,GM),(GM,GM)),LJ),MT):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64421.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1530 total characters: > All characters are of type 'unord' > All characters have equal weight > 1030 characters are constant > 412 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 88 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC106714 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 642 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((MT,MT),GM),ST):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:11 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64509.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 620 total characters: > All characters are of type 'unord' > All characters have equal weight > 264 characters are constant > 107 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 249 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = OGI TC252264 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2134 > Score of best tree(s) found = 921 > Number of trees retained = 3 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((OGI,OGI),((PGI,PGI),PGI)),(ST,((((GM,LJ),MT),MT),((ST,ST),AGI)))):0.3333; tree PAUP_2 = [&R] (((OGI,OGI),((PGI,PGI),PGI)),(((ST,(((GM,LJ),MT),MT)),(ST,ST)),AGI)):0.3333; tree PAUP_3 = [&R] (((OGI,OGI),((PGI,PGI),PGI)),(ST,(((((GM,LJ),MT),MT),AGI),(ST,ST)))):0.3333; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:12 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl6460.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1417 total characters: > All characters are of type 'unord' > All characters have equal weight > 699 characters are constant > 170 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 548 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC204824 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 100793 > Score of best tree(s) found = 5820 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.15 sec) ] tree PAUP_1 = [&R] (((((GM,(GM,MT)),LJ),(ST,ST)),(((AGI,(AGI,AGI)),((((((GM,MT),MT),(ST,(((GM,((LJ,GM),MT)),(ST,ST)),(GM,GM)))),(ST,((AGI,AGI),(AGI,AGI)))),AGI),((AGI,AGI),PGI))),(OGI,(((GM,MT),ST),(((PGI,PGI),PGI),(PGI,PGI)))))),((OGI,((OGI,(((PGI,(PGI,PGI)),(PGI,PGI)),PGI)),OGI)),(((OGI,OGI),OGI),(((OGI,OGI),OGI),OGI)))):0.5000; tree PAUP_2 = [&R] (((((GM,(GM,MT)),LJ),(ST,ST)),(((AGI,(AGI,AGI)),((((((GM,MT),MT),(ST,(((GM,((LJ,GM),MT)),(ST,ST)),(GM,GM)))),((ST,(AGI,AGI)),(AGI,AGI))),AGI),((AGI,AGI),PGI))),(OGI,(((GM,MT),ST),(((PGI,PGI),PGI),(PGI,PGI)))))),((OGI,((OGI,(((PGI,(PGI,PGI)),(PGI,PGI)),PGI)),OGI)),(((OGI,OGI),OGI),(((OGI,OGI),OGI),OGI)))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64732.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1175 total characters: > All characters are of type 'unord' > All characters have equal weight > 642 characters are constant > 242 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 291 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC102426 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 211 > Score of best tree(s) found = 1055 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((MT,PGI),((((GM,MT),GM),AGI),(ST,ST))):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64748.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 768 total characters: > All characters are of type 'unord' > All characters have equal weight > 569 characters are constant > 149 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 50 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC7946 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 264 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] ((((LJ,MT),GM),ST),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl6491.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 774 total characters: > All characters are of type 'unord' > All characters have equal weight > 479 characters are constant > 236 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 59 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = AGI TC255088 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 12 > Score of best tree(s) found = 381 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((AGI,(GM,LJ)),OGI),PGI):1.0000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl64946.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 738 total characters: > All characters are of type 'unord' > All characters have equal weight > 590 characters are constant > 98 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 50 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = LJ TC17554 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 68 > Score of best tree(s) found = 199 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((LJ,(MT,MT)),AGI),(ST,OGI)):0.5000; tree PAUP_2 = [&R] ((LJ,(MT,MT)),((AGI,OGI),ST)):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl65084.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 870 total characters: > All characters are of type 'unord' > All characters have equal weight > 503 characters are constant > 118 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 249 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = GM TC215339 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 787 > Score of best tree(s) found = 816 > Number of trees retained = 2 > Time used = <1 sec (CPU time = 0.00 sec) ] tree PAUP_1 = [&R] (((((GM,GM),(LJ,MT)),AGI),(ST,ST)),(PGI,(OGI,OGI))):0.5000; tree PAUP_2 = [&R] (((((GM,GM),LJ),MT),AGI),((ST,ST),(PGI,(OGI,OGI)))):0.5000; End; #NEXUS Begin trees; [Treefile saved Sun Feb 26 14:56:39 2006] [! >Data file = /home/mmcmahon/EST/analyses/nexfiles2/cl65273.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1711 total characters: > All characters are of type 'unord' > All characters have equal weight > 1077 characters are constant > 503 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 131 > Gaps are treated as "missing" > Starting tree(s) obtained via stepwise addition > Addition sequence: simple (reference taxon = MT TC100321 1) > Number of trees held at each step during stepwise addition = 1 > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Steepest descent option not in effect > 'MaxTrees' setting = 10000 (will not be increased) > Zero-length branches not collapsed > 'MulTrees' option in effect > Topological constraints not enforced > Trees are unrooted > >Heuristic search completed > Total number of rearrangements tried = 2 > Score of best tree(s) found = 811 > Number of trees retained = 1 > Time used = <1 sec (CPU time = 0.00 sec)