Constructing phylogenetic trees efficiently using compatibility criteria

Abstract The Character Compatibility Problem is a classical problem in computational biology concerned with constructing phylogenetic trees of minimum possible evolution from qualitative character sets. This problem arose in the 1970s, and until recently the only cases for which efficient algorithms were found were for binary (i.e. two-state) characters and for two characters at a time, while the complexity of the general problem remained open. In this paper we will discuss the remarkable progress on this problem since 1990.

[1]  W. Fitch.  Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[2]  R. Graham,et al.  The steiner problem in phylogeny is NP-complete , 1982 .

[3]  Sampath Kannan,et al.  Triangulating 3-Colored Graphs , 1992, SIAM J. Discret. Math..

[4]  R. Thorne,et al.  Phenetic and Phylogenetic Classification , 1964, Nature.

[5]  Michael R. Fellows,et al.  Two Strikes Against Perfect Phylogeny , 1992, ICALP.

[6]  David Fernández-Baca,et al.  A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed , 1993, FOCS.

[7]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..

[8]  Le Quesne,et al.  The Uniquely Evolved Character Concept , 1977 .

[9]  G. Estabrook,et al.  A SIMPLE TEST FOR THE POSSIBLE SIMULTANEOUS EVOLUTIONARY DIVERGENCE OF TWO AMINO ACID POSITIONS , 1975 .

[10]  Fred R. McMorris,et al.  Triangulating vertex colored graphs , 1994, SODA '93.

[11]  J. Farris,et al.  Quantitative Phyletics and the Evolution of Anurans , 1969 .

[12]  Alejandro A. Schäffer,et al.  Triangulating Three-Colored Graphs in Linear Time and Linear Space , 1993, SIAM J. Discret. Math..

[13]  Mike Steel,et al.  Convex tree realizations of partitions , 1992 .

[14]  A. Edwards,et al.  The reconstruction of evolution , 1963 .

[15]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[16]  G. Estabrook,et al.  Compatibility Methods in Systematics , 1985 .

[17]  G. Estabrook,et al.  Cladistic Methodology: A Discussion of the Theoretical Basis for the Induction of Evolutionary History , 1972 .

[18]  M. Steel.  The complexity of reconstructing trees from qualitative characters and subtrees , 1992 .

[19]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[20]  W. H. Day.  Computationally difficult parsimony problems in phylogenetic systematics , 1983 .

[21]  W. J. Quesne.  The Uniquely Evolved Character Concept and its Cladistic Application , 1974 .

[22]  J. Felsenstein.  Numerical Methods for Inferring Evolutionary Trees , 1982, The Quarterly Review of Biology.

[23]  Brian W. Kernighan,et al.  The C Programming Language , 1978 .

[24]  Walter J. Lequesne.  Further Studies Based on the Uniquely Derived Character Concept , 1972 .

[25]  W. J. Quesne,et al.  A Method of Selection of Characters in Numerical Taxonomy , 1969 .

[26]  R. Sokal,et al.  A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY , 1965 .

[27]  G. Estabrook,et al.  An idealized concept of the true cladistic character , 1975 .

[28]  Dennis M. Ritchie,et al.  The C programming language - ANSI C - Second edition , 1988 .

[29]  F. McMorris,et al.  When are two qualitative taxonomic characters compatible? , 1977, Journal of mathematical biology.

[30]  Dan Gusfield,et al.  Efficient algorithms for inferring evolutionary trees , 1991, Networks.

[31]  Sampath Kannan,et al.  Triangulating three-colored graphs , 1991, SODA '91.

[32]  Sampath Kannan,et al.  Inferring Evolutionary History from DNA Sequences , 1994, SIAM J. Comput..

[33]  Sampath Kannan,et al.  Inferring evolutionary history from DNA sequences , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[34]  David S. Johnson,et al.  The computational complexity of inferring rooted phylogenies by parsimony , 1986 .

[35]  Ton Kloks,et al.  A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs , 1992, J. Algorithms.

[36]  David Sankoff,et al.  COMPUTATIONAL COMPLEXITY OF INFERRING PHYLOGENIES BY COMPATIBILITY , 1986 .

[37]  F. McMorris.  On the compatibility of binary qualitative taxonomic characters. , 1977, Bulletin of mathematical biology.