You are not currently logged in.
Access JSTOR through your library or other institution:
Computational Complexity of Inferring Phylogenies by Compatibility
William H. E. Day and David Sankoff
Vol. 35, No. 2 (Jun., 1986), pp. 224-229
Stable URL: http://www.jstor.org/stable/2413432
Page Count: 6
Preview not available
A well-known approach to inferring phylogenies involves finding a phylogeny with the largest number of characters that are perfectly compatible with it. Variations of this problem depend on whether characters are: cladistic (rooted) or qualitative (unrooted); binary (two states) or unconstrained (more than one state). The computational cost of known algorithms that guarantee solutions to these problems increases at least exponentially with problem size; practical computational considerations restrict the use of such algorithms to analyzing problems of small size. We establish that the four basic variants of the compatibility problem are all NP-complete and, thus, are so difficult computationally that for them efficient optimal algorithms are not likely to exist.
Systematic Zoology © 1986 Oxford University Press