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.

A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. / Kannan, Sampath; Warnow, Tandy.

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995). ACM, New York, 1995. p. 595-603.

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

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). ACM, New York, pp. 595-603.
Kannan S, Warnow T. 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). ACM, New York. 1995. p. 595-603
Kannan, Sampath ; Warnow, Tandy. / A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed. Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995). ACM, New York, 1995. pp. 595-603
@inproceedings{d7acb727fa334300a8c29d0be4de8ebd,
title = "A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed",
author = "Sampath Kannan and Tandy Warnow",
year = "1995",
language = "English (US)",
pages = "595--603",
booktitle = "Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995)",
publisher = "ACM, New York",

}

TY - GEN

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

AU - Kannan, Sampath

AU - Warnow, Tandy

PY - 1995

Y1 - 1995

M3 - Conference contribution

SP - 595

EP - 603

BT - Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995)

PB - ACM, New York

ER -