#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 t