True compatibility of character will usually get you a lot closer to a happy marriage.
Morphological and molecular studies have showed that 25 species of genus Anopheles are present in the country; however, relationships between vector and non-vector species as well as compatibility of morphological characters with molecular data have not been verified.
This includes a solution for compatibility issues of character datasets from different sources and also the possibility of recording character data at various levels of concreteness, ranging from a single instance of a structure on a specimen to the individual specimen as such.
We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function f(r) such that, for any set C of r-state characters, C is compatible if and only if every subset of f(r) characters of C is compatible.
We study the compatibility of three-state characters further.
In this paper we study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters.
If Conjecture 1 is true, it would follow that we can determine if any set C of r-state characters is compatible by testing the compatibility of each subset of f(r) characters of C, and, in case of incompatibility, output a subset of at most f(r) characters of C that is incompatible.
The following lemma relating quartet compatibility to character compatibility is well known [ 24], and its proof is omitted here.
The perfect phylogeny problem (or character compatibility problem) is to determine whether a given set of characters is compatible.
The specific algorithm for the examination of character compatibility and selection of compatible binary characters was given by Le Quesne [ 18], generalized later for multistate characters by Estabrook [ 19, 20].
