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

Authors:
Sampath Kannan;Tandy Warnow
Affiliations:
Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA
Venue:
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Year:
1995

Constructing evolutionary trees in the presence of polymorphic characters

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Reconstructing the evolutionary history of natural languages

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
From Quartets to Phylogenetic Trees

SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
On the Generalised Character Compatibility Problem for Non-branching Character Trees

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Reducing multi-state to binary perfect phylogeny with applications to missing, removable, inserted, and deleted data

WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Towards a characterisation of the generalised cladistic character compatibility problem for non-branching character trees

ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
On a conjecture about compatibility of multi-states characters

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Efficiently solvable perfect phylogeny problems on binary and k-state data with missing values

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics

Hi-index	0.03