Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Constructing the Suffix Tree of a Tree with a Large Alphabet
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Tree Pattern Matching for Linear Static Terms
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Efficient Learning of Semi-structured Data from Queries
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Discovering Best Variable-Length-Don't-Care Patterns
DS '02 Proceedings of the 5th International Conference on Discovery Science
Finding Smallest Supertrees Under Minor Containment
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Structuring labeled trees for optimal succinctness, and beyond
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Compressing and indexing labeled trees, with applications
Journal of the ACM (JACM)
On-line construction of compact directed acyclic word graphs
Discrete Applied Mathematics
Algorithms and theory of computation handbook
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Computing all subtree repeats in ordered ranked trees
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Approximate matching in weighted sequences
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
An output-polynomial time algorithm for mining frequent closed attribute trees
ILP'05 Proceedings of the 15th international conference on Inductive Logic Programming
A bit-parallel tree matching algorithm for patterns with horizontal VLDC's
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
Multiway-tree retrieval based on treegrams
ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
A classic open problem on tree pattern matching is whether the naive O(mn)-step algorithm for finding all the occurrences of a pattern tree of size m in a text tree of size n can be improved. An O(nM/sup 0.75/ polylog(m))-step algorithm for this tree pattern matching problem is designed. The problems of linear string matching with don't care symbols and linear string max-min convolution are treated.