next up previous
Next: Compatibility and Parsimony Up: Character Based Methods Previous: Local Search

   
Compatibility

Compatibility is another attempt to define a target function for the phylogeny problem: the number of characters which are compatible with the given tree. We will try finding the phylogeny which is compatible with as many characters as possible.

 
\begin{definition}{A character $c$\space with $k$\space possible states is said ...
...at the total number of changes of $c$\space is exactly $k-1$ .}
\end{definition}

Note that when we say that a character c has k states, that means that there are k different values of c in the input. For instance, if for a given DNA site all the species in the input have either `T' or `C', this site has only 2 states, and not 4. It is clear then, that a k-state character can have no less than k-1 changes.

In the following discussion, we will assume that all characters are binary, i.e., have exactly two possible states, 0 and 1.


\begin{example}% latex2html id marker 220
The binary character presented in the ...
... in figure
\ref{lec08:Fig:ParsTree1} is compatible with that tree.
\end{example}


 

Peer Itsik
2001-01-01