#NEXUS

[!Barrett, P. M. et al. 2005. Cranial osteology of Lufengosaurus huenei Young (Dinosauria: Prosauropoda) from the Lower Jurassic of Yunnan, People's Republic of China. Journal of Vertebrate Paleontology, 25, 806-822.]

BEGIN DATA;
	DIMENSIONS  NTAX=11 NCHAR=32;
	FORMAT SYMBOLS= " 0 1 2" MISSING=? GAP=- ;
MATRIX

THEROPODA                   00000000000000000000000000000000
SAUROPODA                   00000000000000000000000000000000
Riojasaurus                 1111111111111111111???0000000000
'"Griposaurus" sinensis'    ??????1111111111111????0????????
Ammosaurus_Anchisaurus      ?111111111111210111????100000000
Yunnanosaurus               ?11111111?1112111111??11?00??001
Massospondylus              111111?11111121111111111?0000001
Lufengosaurus               0?111?1111111211111???11?1?101?0
Coloradisaurus              ?11111?????????????11??1?1111000
Sellosaurus                 ?11111111111121111111??111111110
Plateosaurus                11111111111112111111111111111110
;
END;

BEGIN ASSUMPTIONS;
	OPTIONS  DEFTYPE=unord PolyTcount=MINSTEPS ;
END;

BEGIN TREES;

	Translate
		1 THEROPODA,
		2 SAUROPODA,
		3 Riojasaurus,
		4 '"Griposaurus" sinensis',
		5 Ammosaurus_Anchisaurus,
		6 Yunnanosaurus,
		7 Massospondylus,
		8 Lufengosaurus,
		9 Coloradisaurus,
		10 Sellosaurus,
		11 Plateosaurus
		;
tree MPT_1 = [&R] (1,(2,((3,4),(5,(6,7),(8,(9,(10,11)))))));
tree MPT_2 = [&R] (1,(2,((3,4),(5,(6,7),(((8,10),11),9)))));
tree MPT_3 = [&R] (1,(2,((3,4),(5,(6,7),((8,(10,11)),9)))));
tree MPT_4 = [&R] (1,(2,((3,4),(5,(6,7),((8,10,11),9)))));
tree MPT_5 = [&R] (1,(2,((3,4),(5,((6,7),(8,(9,(10,11))))))));
tree MPT_6 = [&R] (1,(2,((3,4),(5,((6,7),(((8,10),11),9))))));
tree MPT_7 = [&R] (1,(2,((3,4),(5,((6,7),((8,(10,11)),9))))));
tree MPT_8 = [&R] (1,(2,((3,4),(5,((6,7),((8,10,11),9))))));
tree MPT_9 = [&R] (1,(2,(((3,4),((6,7),(8,(9,(10,11))))),5)));
tree MPT_10 = [&R] (1,(2,(((3,4),((6,7),(((8,10),11),9))),5)));
tree MPT_11 = [&R] (1,(2,(((3,4),((6,7),((8,(10,11)),9))),5)));
tree MPT_12 = [&R] (1,(2,(((3,4),((6,7),((8,10,11),9))),5)));
tree MPT_13 = [&R] (1,(2,(3,(4,(5,(6,7),(8,(9,(10,11))))))));
tree MPT_14 = [&R] (1,(2,(3,(4,(5,(6,7),(((8,10),11),9))))));
tree MPT_15 = [&R] (1,(2,(3,(4,(5,(6,7),((8,(10,11)),9))))));
tree MPT_16 = [&R] (1,(2,(3,(4,(5,(6,7),((8,10,11),9))))));
tree MPT_17 = [&R] (1,(2,(3,(4,(5,((6,7),(8,(9,(10,11)))))))));
tree MPT_18 = [&R] (1,(2,(3,(4,(5,((6,7),(((8,10),11),9)))))));
tree MPT_19 = [&R] (1,(2,(3,(4,(5,((6,7),((8,(10,11)),9)))))));
tree MPT_20 = [&R] (1,(2,(3,(4,(5,((6,7),((8,10,11),9)))))));
tree MPT_21 = [&R] (1,(2,((3,(5,(6,7),(8,(9,(10,11))))),4)));
tree MPT_22 = [&R] (1,(2,((3,(5,(6,7),(((8,10),11),9))),4)));
tree MPT_23 = [&R] (1,(2,((3,(5,(6,7),((8,(10,11)),9))),4)));
tree MPT_24 = [&R] (1,(2,((3,(5,(6,7),((8,10,11),9))),4)));
tree MPT_25 = [&R] (1,(2,((3,(5,((6,7),(8,(9,(10,11)))))),4)));
tree MPT_26 = [&R] (1,(2,((3,(5,((6,7),(((8,10),11),9)))),4)));
tree MPT_27 = [&R] (1,(2,((3,(5,((6,7),((8,(10,11)),9)))),4)));
tree MPT_28 = [&R] (1,(2,((3,(5,((6,7),((8,10,11),9)))),4)));
END;