Q: How do you find the minimum # of changes needed to explain the data in a given tree?
A: The answer will be to construct a set of possible ways to get from one set to the other, and choose the "best". (for example: Maximum Parsimony)
CCGCCACGA
P P R
CGGCCACGA
R P R
Previous slide | Next slide | Back to first slide | View graphic version |