Encyclopedia of Algorithms

2008 Edition
| Editors: Ming-Yang Kao

Directed Perfect Phylogeny (Binary Characters)

1991; Gusfield
  • Jesper Jansson
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30162-4_112

Keywords and Synonyms

Directed binary character compatibility          

Problem Definition

Let \( { S = \{s_1,s_2,\dots,s_n\} } \)

This is a preview of subscription content, log in to check access.



Supported in part by Kyushu University, JSPS (Japan Society for the Promotion of Science), and INRIA Lille - Nord Europe.

Recommended Reading

  1. 1.
    Agarwala, R., Fernández-Baca, D., Slutzki, G.: Fast algorithms for inferring evolutionary trees. J. Comput. Biol. 2, 397–407 (1995)CrossRefGoogle Scholar
  2. 2.
    Estabrook, G.F., Johnson, C.S., Jr., McMorris, F.R.: An algebraic analysis of cladistic characters. Discret. Math. 16, 141–147 (1976)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Estabrook, G.F., Johnson, C.S., Jr., McMorris, F.R.: A mathematical foundation for the analysis of cladistic character compatibility. Math. Biosci. 29, 181–187 (1976)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Felsenstein, J.: Inferring Phylogenies. Sinauer Associates, Inc., Sunderland (2004)Google Scholar
  5. 5.
    Fernández-Baca, D.: The Perfect Phylogeny Problem. In: Cheng, X., Du, D.-Z. (eds.) Steiner Trees in Industry, pp. 203–234. Kluwer Academic Publishers, Dordrecht (2001)CrossRefGoogle Scholar
  6. 6.
    Gusfield, D.M.: Efficient algorithms for inferring evolutionary trees. Networks 21, 19–28 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Gusfield, D.M.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, New York (1997)zbMATHCrossRefGoogle Scholar
  8. 8.
    Hanisch, D., Zimmer, R., Lengauer, T.: ProML – the Protein Markup Language for specification of protein sequences, structures and families. In: Silico Biol. 2, 0029 (2002). http://www.bioinfo.de/isb/2002/02/0029/
  9. 9.
    Kanj, I.A., Nakhleh, L., Xia, G.: Reconstructing evolution of natural languages: Complexity and parametrized algorithms. In: Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON 2006). Lecture Notes in Computer Science, vol. 4112, pp. 299–308. Springer, Berlin (2006)Google Scholar
  10. 10.
    McMorris, F.R.: On the compatibility of binary qualitative taxonomic characters. Bull. Math. Biol. 39, 133–138 (1977)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Setubal, J.C., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Publishing Company, Boston (1997)Google Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  • Jesper Jansson
    • 1
  1. 1.Ochanomizu UniversityTokyoJapan