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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English (US)
Title of host publication	Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1995)
Publisher	ACM, New York
Pages	595-603
Number of pages	9
State	Published - 1995

Library availability

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 proceeding › Conference contribution

@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 -