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.
No takes yet. Share an insight, caveat, or question.
Benham et al. (1995) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: