Efficiently mining frequent trees in a forest
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Unordered Tree Mining with Applications to Phylogeny
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Preserving mapping consistency under schema changes
The VLDB Journal — The International Journal on Very Large Data Bases
Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications
IEEE Transactions on Knowledge and Data Engineering
Frequent subgraph mining in outerplanar graphs
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
2-tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics - Special issue: Max-algebra
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Theoretical Computer Science
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Frequent Subtree Mining - An Overview
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Graph Theory, Computational Intelligence and Thought
2-Tree probe interval graphs have a large obstruction set
Discrete Applied Mathematics
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Mining of frequent block preserving outerplanar graph structured patterns
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Frequent subgraph mining in outerplanar graphs
Data Mining and Knowledge Discovery
Indexing tree and subtree by using a structure network
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Fast algorithms for comparison of similar unordered trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficiently Mining Frequent Embedded Unordered Trees
Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
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
Efficient processing of containment queries on nested sets
Proceedings of the 16th International Conference on Extending Database Technology
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |