Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
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
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Analogs and Duals of teh MAST Problem for Sequences and Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Finding Smallest Supertrees Under Minor Containment
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Deriving transfer rules from dominance-preserving alignments
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Calculation, Visualization, and Manipulation of MASTs (Maximum Agreement Subtrees)
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
Computing the maximum agreement of phylogenetic networks
Theoretical Computer Science - Pattern discovery in the post genome
Sentence Fusion for Multidocument News Summarization
Computational Linguistics
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Pattern Identification in Biogeography
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Theoretical Computer Science
Discovering Frequent Agreement Subtrees from Phylogenetic Data
IEEE Transactions on Knowledge and Data Engineering
Linear time 3-approximation for the MAST problem
ACM Transactions on Algorithms (TALG)
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
An improved algorithm for the maximum agreement subtree problem
Information Processing Letters
Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Uncovering Hidden Phylogenetic Consensus in Large Data Sets
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A model for complex tree integration tasks
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
The kernel of maximum agreement subtrees
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
A metric for phylogenetic trees based on matching
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
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
Pattern identification in biogeography
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
The maximum agreement of two nested phylogenetic networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Uncovering hidden phylogenetic consensus
ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
A Metric for Phylogenetic Trees Based on Matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
The Kernel of Maximum Agreement Subtrees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Identifying rogue taxa through reduced consensus: NP-Hardness and exact algorithms
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Approximate algorithms for solving o1 consensus problems using complex tree structure
Transactions on Computational Collective Intelligence VIII
Using subtree agreement for complex tree integration tasks
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II
Sentence fusion for multidocument news summarization
Computational Linguistics
| Hi-index | 0.89 |