Abstract

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.

Original languageEnglish (US)
Pages (from-to)515-525
Number of pages11
JournalJournal of Computational Biology
Volume2
Issue number4
DOIs
StatePublished - 1995

ASJC Scopus subject areas

  • Modeling and Simulation
  • Molecular Biology
  • Genetics
  • Computational Mathematics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Hen's Teeth and Whale's Feet: Generalized Characters and Their Compatibility'. Together they form a unique fingerprint.

  • Cite this