A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed

Sampath Kannan, Tandy Warnow

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationProceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995)
PublisherACM, New York
Pages595-603
Number of pages9
StatePublished - 1995

Cite this

Kannan, S., & Warnow, T. (1995). A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. In Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995) (pp. 595-603). ACM, New York.