Advertisement

On the Generalised Character Compatibility Problem for Non-branching Character Trees

  • Ján Maňuch
  • Murray Patterson
  • Arvind Gupta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5609)

Abstract

In [13], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem takes into account the fact that while a species may not be expressing a certain trait, i.e., having teeth, its DNA may contain data for this trait in a non-functional region. The authors showed that the Generalised Character Compatibility Problem is NP-complete for an instance of the problem involving five states, where the characters’ state transition trees are branching. They also presented a class of instances of the problem that is polynomial-time solvable. The authors posed an open problem about the complexity of this problem when no branching is allowed in the character trees. They answered this question in [2], where they showed that for an instance in which each character tree is 0→1→2 (no branching), and only the states {1},{0,2},{0,1,2} are allowed, is NP-complete. This, however, does not provide an answer to the exact question posed in [3], which allows only one type of generalised state: {0,2}, called here the Benham-Kannan-Warnow (BKW) Case.

In this paper, we study the complexity of various versions of this problem with non-branching character trees, depending on the set of states allowed, and depending on the restriction on the phylogeny tree: any tree, path or single-branch tree. In particular, we show that if the phylogeny tree is required to have only one branch: (a) the problem still remains NP-complete (for instance with states {1},{0,2},{0,1,2}), and (b) the problem is polynomial-time solvable in the BKW Case (with states {0},{1},{2},{0,2}). We show the second result by unveiling a surprising connection to the Consecutive-Ones Property (C1P) Problem, used for instance, in DNA physical mapping, interval graph recognition and data retrieval.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Agarwala, R., Fernandez-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM J. on Computing 26(6), 1216–1224 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Benham, C.J., Kannan, S., Paterson, M., Warnow, T.: Hen’s teeth and whale’s feet: Generalized characters and their compatibility. Journal of Computational Biology 2(4), 515–525 (1995)CrossRefGoogle Scholar
  3. 3.
    Benham, C.J., Kannan, S., Warnow, T.: Of chicken teeth and mouse eyes, or generalized character compatibility. In: Galil, Z., Ukkonen, E. (eds.) CPM 1995. LNCS, vol. 937, pp. 17–26. Springer, Heidelberg (1995)Google Scholar
  4. 4.
    Bodlaender, H., Fellows, M., Warnow, T.: Two strikes against perfect phylogeny. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 273–283. Springer, Heidelberg (1992)Google Scholar
  5. 5.
    Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property of, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and Systems Sciences 13(3), 335–379 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Felsenstein, J.: Numerical methods for inferring evolutionary trees. The Quarterly Review of Biology 57(4), 379–404 (1982)CrossRefGoogle Scholar
  7. 7.
    Janis, C.: The sabertooth’s repeat performances. Natural History 103, 78–82 (1994)Google Scholar
  8. 8.
    Kannan, S., Warnow, T.: Inferring evolutionary history from DNA sequences. SIAM J. on Computing 23(4), 713–737 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Kannan, S., Warnow, T.: A fast algorithm for the computation and enumeration of perfect phylogenies. In: SODA, pp. 595–603 (1995)Google Scholar
  10. 10.
    Kollar, E.J., Fisher, C.: Tooth induction in chick epithelium: Expression of quiescent genes for enamel synthesis. Science 207, 993–995 (1980)CrossRefGoogle Scholar
  11. 11.
    McMorris, F.R., Warnow, T., Wimer, T.: Triangulating vertex colored graphs. SIAM J. on Discrete Mathematics 7(2), 296–306 (1994)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Opatrny, J.: Total ordering problem. SIAM J. on Computing 8(1), 111–114 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification 9, 91–116 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Telles, G.P., Meidanis, J.: Building PQR trees in almost-linear time. In: Proc. of GRACO, pp. 33–39 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Ján Maňuch
    • 1
  • Murray Patterson
    • 1
  • Arvind Gupta
    • 1
  1. 1.School of Computing ScienceSimon Fraser UniversityBurnabyCanada

Personalised recommendations