HW2:

Part 1:
Create a data matrix for 7 taxa
using 2-state characters such that the set
of most-parsimonious trees differs from the 
the set of trees that are tied for being
the best tree according to the maximum
compatibility criterion.

If you wish, you can start with the 
data matrix below. It is possible to complete
this assignment by adding only one character
to that matrix. But you are not required to 
expand on that matrix (or find a way to answer
the question by only adding one character to that
matrix).


Part 2: 
Explain in words the difference in how information
from characters is used by parsimony but
not used by compatibility. A couple of
sentences should be sufficient.


#####################################


#NEXUS 

Begin data;
	Dimensions ntax=7 nchar=4;
	Format datatype=standard;
	Matrix
A  0000
B  0000
C  0000
D  1100
E  1111
F  1111
G  1111
	;
End;