Of chicken teeth and mouse eyes, or generalized character compatibility
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.
Unable to display preview. Download preview PDF.
- 1.R. Agarwala, and D. Fernández-Baca, (1994), Fast and simple algorithms for perfect phytogeny and triangulating colored graphs, DIMACS Tech Report # 94-51.Google Scholar
- 3.Alberts, B., Bray, D., Lewis, J., Raff, M., Roberts, K. and Watson, J.D. (1989) The Molecular Biology of the Cell, 2nd Ed., Garland Publishing Inc., New York, pp. 485–488.Google Scholar
- 4.H. Bodlaender, M. Fellows, and T. Warnow (1992), Two strikes against perfect phylogeny, Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Springer Verlag, Lecture Notes in Computer Science, pp. 273–283.Google Scholar
- 5.J. Felsenstein (1982), Numerical methods for inferring evolutionary trees, The Quarterly Review of Biology, Vol. 57, No. 4.Google Scholar
- 6.Janis, C. (1994) The Sabertooth's Repeat Performances Nat'l. Hist., 103 pp. 78–82.Google Scholar
- 8.S. Kannan and T. Warnow, A fast algorithm for the computation and enumeration of perfect phylogenies, Proceedings, ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1995, pp. 595–603.Google Scholar
- 11.Michael Steel (1992), The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees, Journal of Classification, Vol. 9, pp. 91–116.Google Scholar