Short encodings of evolving structures
SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some Notes on the Nearest Neighbour Interchange Distance
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
On reconstructing species trees from gene trees in term of duplications and losses
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Efficient algorithms for lateral gene transfer problems
RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
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
Case Study: Visualizing Sets of Evolutionary Trees
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
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
Non-shared edges and nearest neighbor interchanges revisited
Information Processing Letters
The maximum agreement forest problem: Approximation algorithms and computational experiments
Theoretical Computer Science
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Drawing (Complete) Binary Tanglegrams
Graph Drawing
The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Evolving phylogenetic trees: a multiobjective approach
BSB'07 Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology
The gene-duplication problem: near-linear time algorithms for NNI based local searches
ISBRA'08 Proceedings of the 4th international conference on Bioinformatics research and applications
Metrics on Multilabeled Trees: Interrelationships and Diameter Bounds
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A metric for phylogenetic trees based on matching
ISBRA'11 Proceedings of the 7th international conference on Bioinformatics research and applications
A distance for partially labeled trees
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Matching Split Distance for Unrooted Binary Phylogenetic Trees
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection
A Metric for Phylogenetic Trees Based on Matching
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A robinson-foulds measure to compare unrooted trees with rooted trees
ISBRA'12 Proceedings of the 8th international conference on Bioinformatics Research and Applications
Seeded tree alignment and planar tanglegram layout
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Hi-index | 0.00 |