A robust model for finding optimal evolutionary trees
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Parallelizing the phylogeny problem
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Constructing evolutionary trees in the presence of polymorphic characters
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Better methods for solving parsimony and compatibility
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Obtaining highly accurate topology estimates of evolutionary trees from very short sequences
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Triangulating vertex colored graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Reconstructing the evolutionary history of natural languages
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fast comparison of evolutionary trees
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Recovering branches on the tree of life: an approximation algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Linear-time register allocation for a fixed number of registers
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Heuristics for the Phylogeny Problem
Journal of Heuristics
A characterization for a set of partial partitions to define an X-tree
Discrete Mathematics
Tree Reconstruction via a Closure Operation on Partial Splits
JOBIM '00 Selected papers from the First International Conference on Computational Biology, Biology, Informatics, and Mathematics
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
Incomplete Directed Perfect Phylogeny
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Computing unrooted maximum subtrees in sub-quartic time
Nordic Journal of Computing
Selecting the branches for an evolutionary tree: a polynomial time approximation scheme
Journal of Algorithms
Bioinformatics on a Heterogeneous Java Distributed System
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Efficient approximation of convex recolorings
Journal of Computer and System Sciences
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Convex recolorings of strings and trees: Definitions, hardness results and algorithms
Journal of Computer and System Sciences
Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem
International Journal of Bioinformatics Research and Applications
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
On the Generalised Character Compatibility Problem for Non-branching Character Trees
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Combinatorial problems arising in SNP and haplotype analysis
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
An experimental study of quartets MaxCut and other supertree methods
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Applications of answer set programming in phylogenetic systematics
Logic programming, knowledge representation, and nonmonotonic reasoning
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
Unique perfect phylogeny is NP-hard
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Constructing perfect phylogenies and proper triangulations for three-state characters
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
On a conjecture about compatibility of multi-states characters
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation algorithm for convex recoloring of trees
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Reconstructing evolution of natural languages: complexity and parameterized algorithms
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Efficient approximation of convex recolorings
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Convex recolorings of strings and trees: definitions, hardness results and algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
Simple reconstruction of binary near-perfect phylogenetic trees
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
A parameterized algorithm for chordal sandwich
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
Sharp tractability borderlines for finding connected motifs in vertex-colored graphs
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Improved lower bounds on the compatibility of quartets, triplets, and multi-state characters
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Unique perfect phylogeny is intractable
Theoretical Computer Science
Note: Optimizing tree and character compatibility across several phylogenetic trees
Theoretical Computer Science
| Hi-index | 0.01 |