On the Pattern Recognition of Noisy Subsequence Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Syntactic Pattern Recognition by Error Correcting Analysis on Tree Automata
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
A New Measure of Edit Distance between Labeled Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On Maximum Symmetric Subgraphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Improving system dependability by enforcing architectural intent
WADS '05 Proceedings of the 2005 workshop on Architecting dependable systems
A survey on tree edit distance and related problems
Theoretical Computer Science
Data mining in an engineering design environment: OR applications from graph matching
Computers and Operations Research
Merging distributed database summaries
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Improved approximation of the largest common subtree of two unordered trees of bounded height
Information Processing Letters
A constrained edit distance algorithm between semi-ordered trees
Theoretical Computer Science
Sibling Distance for Rooted Labeled Trees
New Frontiers in Applied Data Mining
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Multi-label classification and extracting predicted class hierarchies
Pattern Recognition
Exact algorithms for computing the tree edit distance between unordered trees
Theoretical Computer Science
Improved MAX SNP-hard results for finding an edit distance between unordered trees
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Fast algorithms for comparison of similar unordered trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Local gapped subforest alignment and its application in finding RNA structural motifs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Structured merge with auto-tuning: balancing precision and performance
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Efficient exponential time algorithms for edit distance between unordered trees
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
RNA tree comparisons via unrooted unordered alignments
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Theoretical Computer Science
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
RWS-Diff: flexible and efficient change detection in hierarchical data
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
On the complexity of finding a largest common subtree of bounded degree
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Efficient exponential-time algorithms for edit distance between unordered trees
Journal of Discrete Algorithms
| Hi-index | 0.90 |