Constructing evolutionary trees in the presence of polymorphic characters

Authors:
Maria Bonet;Cynthia Phillips;Tandy J. Warnow;Shibu Yooseph
Affiliations:
Department of Mathematics, University of Pennsylvania;Sandia National Labs, Albuquerque, NM;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA;Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA
Venue:
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Year:
1996

Citing 10
Cited 2

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Triangulating 3-colored graphs

SIAM Journal on Discrete Mathematics
Triangulating three-colored graphs in linear time and linear space

SIAM Journal on Discrete Mathematics
A simple linear time algorithm for triangulating three-colored graphs

Journal of Algorithms
Triangulating Vertex-Colored Graphs

SIAM Journal on Discrete Mathematics
Inferring Evolutionary History from DNA Sequences

SIAM Journal on Computing
A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed

SIAM Journal on Computing
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
Reconstructing the evolutionary history of natural languages

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Two Strikes Against Perfect Phylogeny

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming

Better methods for solving parsimony and compatibility

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Subexponential parameterized algorithm for minimum fill-in

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract