Hypothesis testing in perfect phylogeny for a bounded number of characters
We introduce the hypothesis testing problem (HTP). In HTP the input is a family of species F and a hypothesis, i.e., a tree where the leaves are labeled with species from some subfamily of F. The problem is to decide whether there is a perfect phylogeny for F which agrees with the hypothesis. We show that HTP can be solved in O(m2r m |F|(|F|+mr)) time, where m is the number of characters and r is the maximum number of states on any character. We obtain an O(m3rm+1 + |F|m2) algorithm for the perfect phylogeny problem (PPP), as well. The fastest previously known algorithm for PPP, with fixed m, has running time O(mm+1rm+1 + |F|m2) . We also consider several variations of HTP which we either show to be solvable in polynomial time or NP-complete.
KeywordsPolynomial Time Evolutionary Tree Polynomial Time Algorithm Colored Graph Linear Time Algorithm
Unable to display preview. Download preview PDF.
- 1.R. Agarwala and D. Fernández-Baca. A polynomial time algorithm for the perfect phylogeny problem when the number of character states is fixed. In 34:th FOCS, pages 140–146, 1993.Google Scholar
- 2.S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 8:277–284, 1987.Google Scholar
- 3.H. Bodlaender and B. L. E. de Fluiter. Intervalizing k-colored graphs. In 22:nd ICALP, pages 87–98, 1995.Google Scholar
- 4.H. Bodlaender, M. Fellows, and M. Hallet. Beyond NP-completeness for problems of bounded witdh: Hardness for the W hierarchy. In 26 STOC, pages 449–458, 1994.Google Scholar
- 5.H. Bodlaender, M. Fellows, and T. Warnow. Two strikes against perfect phylogeny. In 19:th ICALP, pages 273–283, 1992.Google Scholar
- 9.S. Kannan and T. Warnow. A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. In 6:th SODA, pages 595–603, 1995.Google Scholar
- 10.F.R. McMorris, T. J. Warnow, and T. Wimer. Triangulating vertex-colored graphs. SIAM J. Discrete Math., pages 296–306, 1994.Google Scholar
- 11.M.A. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification, pages 91–116, 1992.Google Scholar