Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Faster and Unifying Algorithm for Comparing Trees
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Finding Smallest Supertrees Under Minor Containment
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Indexing and Mining Free Trees
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Theoretical Computer Science
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Biological networks: comparison, conservation, and evolutionary trees
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Seeded tree alignment and planar tanglegram layout
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
RNA tree comparisons via unrooted unordered alignments
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
| Hi-index | 0.00 |