An efficient algorithm for some tree matching problems
Information Processing Letters
Journal of the ACM (JACM)
Approximate tree matching in the presence of variable length don't cares
Journal of Algorithms
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Approximate matching for two families of trees
Information and Computation
Tree pattern matching and subset matching in randomized O(nlog3m) time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Tree pattern matching and subset matching in deterministic O(n log3 n)-time
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Flexible pattern matching in strings: practical on-line search algorithms for texts and biological sequences
Tree pattern matching with a more general notion of occurrence of the pattern
Information Processing Letters
Transformation of Documents and Schemas by Patterns and Contextual Conditions
PODP '96 Proceedings of the Third International Workshop on Principles of Document Processing
Data Model for Document Transformation and Assembly
PODDP '98 Proceedings of the 4th International Workshop on Principles of Digital Document Processing
A Formal Model for an Expressive Fragment of XSLT
CL '00 Proceedings of the First International Conference on Computational Logic
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Efficient tree pattern matching
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
Hi-index | 0.00 |
The tree pattern matching problem is, given two labeled trees P and T, respectively called pattern tree and target tree, to find all occurrences of P within T. Many studies have been undertaken on this problem for both the cases of ordered and unordered trees. To realize flexible matching, a kind of variable-length-don't-care's (VLDC's) have been introduced. In particular, the path-VLDC's appear in XPath, a language for addressing parts of an XML document. In this paper, we introduce horizontal VLDC's, each matches a sequence of trees whose root nodes are consecutive siblings in ordered trees. We address the tree pattern matching problem for patterns with horizontal VLDC's. In our setting, the target tree is given as a tagged sequence such as XML data stream. We present an algorithm that solves the problem in O(mn) time using O(mh) space, where m and n are the sizes of P and T, respectively, and h is the height of T. We adopt the bit-parallel technique to obtain a practically fast algorithm.