#NEXUS

[File saved Sat Jun 30 17:41:39 2007]

BEGIN TAXA;
	DIMENSIONS NTAX = 30;
	TAXLABELS
		PpPIP1.1
		PpPIP1.2
		PpPIP1.3
		PpPIP2.1
		PpPIP2.2
		PpPIP2.3
		PpPIP2.4
		PpPIP3.1
		PpTIP6.1
		PpTIP6.2
		PpTIP6.3
		PpTIP6.4
		PpHIP1.1
		AJ005078.2
		'EM_PL:D45078 '
		NM_001049035.1
		BJ853041.1
		'EM_PL:X95953'
		'EM_PL:AB206105'
		'EM_PL:L12258'
		'EM_PL:AY525639'
		XM_967769.1
		AF218314.1
		NM_009700.1
		U63623.1
		AY856056.1
		NM_012825.2
		NM_001009279.1
		NM_001003749
		XM_001363548
		;
ENDBLOCK;


BEGIN TREES;
[!>Data file = PpHIP.nex>Heuristic search settings:>  Optimality criterion = parsimony>    Character-status summary:>      Of 434 total characters:>        All characters are of type 'unord'>        All characters have equal weight>        109 characters are constant>        56 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 = PpPIP1.1)>  Number of trees held at each step during stepwise addition = 1>  Branch-swapping algorithm: tree-bisection-reconnection (TBR)>  Steepest descent option not in effect>  Initial 'MaxTrees' setting = 100>  Branches collapsed (creating polytomies) if maximum branch length is zero>  'MulTrees' option in effect>  Topological constraints not enforced>  Trees are unrooted>>Heuristic search completed>   Total number of rearrangements tried = 57015>   Score of best tree(s) found = 1703>   Number of trees retained = 6>   Time used = 0.60 sec]
	TRANSLATE
		1	PpPIP1.1,
		2	PpPIP1.2,
		3	PpPIP1.3,
		4	PpPIP2.1,
		5	PpPIP2.2,
		6	PpPIP2.3,
		7	PpPIP2.4,
		8	PpPIP3.1,
		9	PpTIP6.1,
		10	PpTIP6.2,
		11	PpTIP6.3,
		12	PpTIP6.4,
		13	PpHIP1.1,
		14	AJ005078.2,
		15	'EM_PL:D45078 ',
		16	NM_001049035.1,
		17	BJ853041.1,
		18	'EM_PL:X95953',
		19	'EM_PL:AB206105',
		20	'EM_PL:L12258',
		21	'EM_PL:AY525639',
		22	XM_967769.1,
		23	AF218314.1,
		24	NM_009700.1,
		25	U63623.1,
		26	AY856056.1,
		27	NM_012825.2,
		28	NM_001009279.1,
		29	NM_001003749,
		30	XM_001363548
		;
	TREE * PAUP_1= (1,(2,(3,((7,(4,(5,6))),(8,(((13,((17,(9,(10,(11,12)))),(16,(15,((14,(18,21)),(19,20)))))),(22,23)),(29,(24,((28,(25,30)),(26,27))))))))));
	TREE PAUP_2= (1,(2,(3,((7,(4,(5,6))),(8,(((13,((17,(9,(10,(11,12)))),(16,(15,((14,(18,21)),(19,20)))))),(22,23)),(29,(24,(26,(27,(28,(25,30))))))))))));
	TREE PAUP_3= (1,(2,(3,((7,(4,(5,6))),(8,(((13,((17,(9,(10,(11,12)))),(16,(15,((14,(18,21)),(19,20)))))),(22,23)),(29,(24,(27,(26,(28,(25,30))))))))))));
	TREE PAUP_4= (1,(2,(3,((7,(6,(4,5))),(8,(((13,((17,(9,(10,(11,12)))),(16,(15,((14,(18,21)),(19,20)))))),(22,23)),(29,(24,((28,(25,30)),(26,27))))))))));
	TREE PAUP_5= (1,(2,(3,((7,(6,(4,5))),(8,(((13,((17,(9,(10,(11,12)))),(16,(15,((14,(18,21)),(19,20)))))),(22,23)),(29,(24,(26,(27,(28,(25,30))))))))))));
	TREE PAUP_6= (1,(2,(3,((7,(6,(4,5))),(8,(((13,((17,(9,(10,(11,12)))),(16,(15,((14,(18,21)),(19,20)))))),(22,23)),(29,(24,(27,(26,(28,(25,30))))))))))));
ENDBLOCK;