@inproceedings{fda7c1db00124204b5523d1fd6dac4ee,
title = "Of chicken teeth and mouse eyes, or generalized character compatibility",
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.",
author = "Craig Benham and Sampath Kannan and Tandy Warnow",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; 6th Annual Symposium on Combinatorial Pattern Matching, CPM 1995 ; Conference date: 05-07-1995 Through 07-07-1995",
year = "1995",
doi = "10.1007/3-540-60044-2\_31",
language = "English",
isbn = "3540600442",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "17--26",
editor = "Zvi Galil and Esko Ukkonen",
booktitle = "Combinatorial Pattern Matching - 6th Annual Symposium, CPM 1995, Proceedings",
address = "Germany",
}