On the Generalised Character Compatibility Problem for Non-branching Character Trees

In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem takes into account the fact that while a species may not be expressing a certain trait, i.e., having teeth, its DNA may contain data for this trait in a non-functional region. The authors showed that the Generalised Character Compatibility Problem is NP-complete for an instance of the problem involving five states, where the characters’ state transition trees are branching. They also presented a class of instances of the problem that is polynomial-time solvable. The authors posed an open problem about the complexity of this problem when no branching is allowed in the character trees. They answered this question in [2], where they showed that for an instance in which each character tree is 0 → 1 → 2 (no branching), and only the states {1}, {0, 2}, {0, 1, 2} are allowed, is NP-complete. This, however, doe...

• Type: Conference
• Year: 2009
• Where: COCOON
• Authors: Ján Manuch, Murray Patterson, Arvind Gupta
• Keywords: Character Compatibility Problem, Character Trees, COCOON 2009, Combinatorics, Generalised Character Compatibility