Ordered characters and perfect phylogeny
| • | Assume that we in the last common ancestor all characters had state 0. | |
| • | This assumption makes sense for many characters, for example genes. | |
| • | Then compatibility criterion is even simpler: characters are compatible if and only if there do not exist three taxa containing combinations (1,0),(0,1),(1,1) |
