Maximum likelihood on four taxa phylogenetic trees: analytic solutions
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Minimum-Flip Supertrees: Complexity and Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Using Max Cut to Enhance Rooted Trees Consistency
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The structure of the overhanging relations associated with some types of closure systems
Annals of Mathematics and Artificial Intelligence
Discovering Frequent Agreement Subtrees from Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
From Gene Trees to Species Trees through a Supertree Approach
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
Finding Similar or Diverse Solutions in Answer Set Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
The ultrametric constraint and its application to phylogenetics
Journal of Artificial Intelligence Research
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics
An improved fixed-parameter algorithm for minimum-flip consensus trees
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Hierarchical clustering using constraints
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
Exact ILP solutions for phylogenetic minimum flip problems
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
The complexity of inferring a minimally resolved phylogenetic supertree
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
Polynomial supertree methods revisited
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
RECOMB-CG'10 Proceedings of the 2010 international conference on Comparative genomics
Building species trees from larger parts of phylogenomic databases
Information and Computation
Clustering with relative constraints
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
FlipCut supertrees: towards matrix representation accuracy in polynomial time
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Computing quadratic entropy in evolutionary trees
Computers & Mathematics with Applications
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
ACM Transactions on Algorithms (TALG)
Using semi-definite programming to enhance supertree resolvability
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
The Complexity of Inferring A Minimally Resolved Phylogenetic Supertree
SIAM Journal on Computing
An effective ensemble method for hierarchical clustering
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
| Hi-index | 0.05 |