SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS
- 1 March 1996
- journal article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Foundations of Computer Science
- Vol. 7 (1) , 11-21
- https://doi.org/10.1142/s0129054196000038
Abstract
This paper presents an O((r–n/m)mrnm) algorithm for determining whether a set of n species has a perfect phylogeny, where m is the number of characters used to describe a species and r is the maximum number of states that a character can be in. The perfect phylogeny algorithm leads to an O((2e/k)ke2k) algorithm for triangulating a k-colored graph having e edges.Keywords
This publication has 0 references indexed in Scilit: