#NEXUS Begin trees; [Treefile saved Tuesday, January 25, 2005 9:51 AM] [! >Data file = SM_Combo 12.nex >Heuristic search settings: > Optimality criterion = parsimony > Character-status summary: > Of 1182 total characters: > All characters are of type 'unord' > All characters have equal weight > 521 characters are constant > 174 variable characters are parsimony-uninformative > Number of parsimony-informative characters = 487 > Gaps are treated as "missing" > Multistate taxa interpreted as uncertainty > Branch-swapping algorithm: tree-bisection-reconnection (TBR) > Initial swapping on 2 trees already in memory > Steepest descent option not in effect > Initial 'MaxTrees' setting = 200 (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 = 69276 > Score of best tree(s) found = 3028 > Number of trees retained = 2 > Time used = 0.10 sec ] Translate 1 Mytilus, 2 Astarte, 3 Neotrigonia, 4 Mut_rostrata, 5 Mut_dubia, 6 Chamb_wahlbergi, 7 Asp_rugifera, 8 Ano_trigonus, 9 Ano_guanarensis, 10 Mon_minuana, 11 Eth_elliptica, 12 Aco_rivoli, 13 Pse_dalyi, 14 Hyr_depressa, 15 Hyr_australis, 16 Hyr_menziesi_1, 17 Hyr_menziesi_2, 18 Vel_angasi, 19 Vel_ambiguus, 20 Lor_rugata, 21 Dipl_chilensis, 22 Dipl_deceptus, 23 Castalia, 24 Mar_margaritifera, 25 Cum_monodonta, 26 Coel_aegyptiaca, 27 Pilsbry_exilis, 28 Pse_vondembusch, 29 Con_contradens, 30 Gon_angulata, 31 Trit_verrucosa, 32 Qua_quadrula, 33 Amb_plicata, 34 Ell_dilatata, 35 Ple_coccineum, 36 Fus_flava, 37 Obl_reflexa, 38 Tru_truncata, 39 Act_carinata, 40 Ptycho_fasciolaris, 41 Vill_iris, 42 Lig_recta, 43 Lamp_cardium, 44 Epi_triquetra, 45 Las_compressa, 46 Str_undulatus, 47 Pyg_grandis, 48 Ala_marginata, 49 Unio_pictorum, 50 Caf_caffra ; tree PAUP_1 = [&U] (1,(2,(3,(((((((4,5),(6,7)),((8,9),10)),(11,12)),((((14,15),((21,22),23)),(16,17)),((18,20),19))),((((((13,(49,50)),(45,((46,47),48))),(30,(((31,32),37),((33,(34,(35,36))),((38,((((39,42),41),44),43)),40))))),29),(27,28)),(24,25))),26)))); tree PAUP_2 = [&U] (1,(2,(3,(((((((4,5),(6,7)),((8,9),10)),(11,12)),(((14,(15,((21,22),23))),(16,17)),((18,20),19))),((((((13,(49,50)),(45,((46,47),48))),(30,(((31,32),37),((33,(34,(35,36))),((38,((((39,42),41),44),43)),40))))),29),(27,28)),(24,25))),26)))); End;