Exercises marked with (*) require further reading/search beyond the suggested texts.
1. Find ancestor states that yield the minimum number of changes in the topology below, based on the given matrix of spieces vs. characters.
![]()
C1 C2 C3 A 0 1 1 B 1 1 0 C 1 0 0 D 1 0 1
Answer:
There is no assignment with 3 changes. We can see ancestor states that yield 4 changes, the minimum possible, in the image below:
© 2015 Joao Meidanis