Efficient algorithms for lateral gene transfer problems
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Perfect phylogenetic networks with recombination
Proceedings of the 2001 ACM symposium on Applied computing
Computing similarity between RNA structures
Theoretical Computer Science
Gene Trees and Species Trees: The Gene-Duplication Problem in Fixed-Parameter Tractable
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Some Approximation Results for the Maximum Agreement Forest Problem
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Simultaneous identification of duplications and lateral transfers
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
On contract-and-refine transformations between phylogenetic trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees
IEEE Transactions on Knowledge and Data Engineering
Computing the maximum agreement of phylogenetic networks
Theoretical Computer Science - Pattern discovery in the post genome
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics
The maximum agreement forest problem: Approximation algorithms and computational experiments
Theoretical Computer Science
Maximum agreement and compatible supertrees
Journal of Discrete Algorithms
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A generalization of Haussler's convolution kernel: mapping kernel
Proceedings of the 25th international conference on Machine learning
A 3-approximation algorithm for the subtree distance between phylogenies
Journal of Discrete Algorithms
Kernels Based on Distributions of Agreement Subtrees
AI '08 Proceedings of the 21st Australasian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Linear time 3-approximation for the MAST problem
ACM Transactions on Algorithms (TALG)
Maximum Parsimony for Tree Mixtures
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
Maximum Motif Problem in Vertex-Colored Graphs
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Efficiently Calculating Evolutionary Tree Measures Using SAT
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Approximating the Maximum Agreement Forest on k trees
Information Processing Letters
The longest haplotype reconstruction problem revisited
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
A unifying view on approximation and FPT of agreement forests
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
On the Complexity of uSPR Distance
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Complexity issues in vertex-colored graph pattern matching
Journal of Discrete Algorithms
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
On the approximation of computing evolutionary trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Algorithms for Reticulate Networks of Multiple Phylogenetic Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Fast FPT algorithms for computing rooted agreement forests: theory and experiments
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
ADMA'05 Proceedings of the First international conference on Advanced Data Mining and Applications
Fast computation of the exact hybridization number of two phylogenetic trees
ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
New results for the Longest Haplotype Reconstruction problem
Discrete Applied Mathematics
An algorithm for constructing parsimonious hybridization networks with multiple phylogenetic trees
RECOMB'13 Proceedings of the 17th international conference on Research in Computational Molecular Biology
| Hi-index | 0.00 |