Constructing evolutionary trees in the presence of polymorphic characters
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Tree compatibility and inferring evolutionary history
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Unique perfect phylogeny is NP-hard
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Unique perfect phylogeny is intractable
Theoretical Computer Science
| Hi-index | 0.00 |