#NEXUS 

Begin trees;  [Treefile saved Fri Mar 21 11:45:57 2003]
[!
>Consensus of 48 trees
>
>Source of trees from which consensus(es) calculated...
>Heuristic search settings:
>  Optimality criterion = parsimony
>    Character-status summary:
>      Of 38 total characters:
>        All characters are of type 'unord'
>        All characters have equal weight
>        8 characters are constant
>        7 variable characters are parsimony-uninformative
>        Number of parsimony-informative characters = 23
>    Gaps are treated as "missing"
>  Branch-swapping algorithm: tree-bisection-reconnection (TBR)
>  Initial swapping on 52 trees already in memory
>  Steepest descent option not in effect
>  Initial 'MaxTrees' setting = 4600 (will be auto-increased by 100)
>  Branches collapsed (creating polytomies) if maximum branch length is zero
>  'MulTrees' option in effect
>  Topological constraints not enforced
>  Trees are unrooted
>
>Heuristic search completed
>   Total number of rearrangements tried = 2200376
>   Score of best tree(s) found = 400
>   Number of trees retained = 48
>   Time used = 1 sec (CPU time = 1.55 sec)
]
	tree MajRule = [&U] (AGPD1,(((AGPD2,(((BMPD2,BMPD12),CFPD1),((BMPD9,BMPD10),PRPD1)),CFPD2,CCPD1,MCPD2),((BMPD1,MSPD1),((BMPD3,BMPD3n),BMPD7),((BMPD4t,BMPD8),BMPD6),(BMPD11,(PLD1,PLD5)),(((PLD2,(PLD6,PLD8)),PLD3),PLD7),PLD4),CFPD3,(((LMPI3,((LMPI6,SGPI4A),PLD9)),PMPD2),SGTI),SGPI5a),(((((AGPD6,AGPD3),(((AGPD7,AGPD4),((OSPD2,OSPD3),SGPI3)),(MCPD1,OSPD1))),(((LMPI4,LMPI8),SGPI4B),LMPI7)),((LMPI5,SGPI5b),(PMPC,SGCI))),(LMPI9,SGPI4Ca))),AGPD5);
end;