We propose a new model of computation for deriving phylogenetic trees based upon a generalization of qualitative characters. The model we propose is based upon recent experimental research in molecular biology. We show that the general case of determining perfect compatibility of generalized ordered characters is an NP-complete problem, but can be solved in polynomial time for a special case.
ASJC Scopus subject areas
- Modeling and Simulation
- Molecular Biology
- Computational Mathematics
- Computational Theory and Mathematics