Handbook of theoretical computer science (vol. A)
A new approach to text searching
Communications of the ACM
Journal of the ACM (JACM)
Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Journal of the ACM (JACM)
Journal of Algorithms
Verifying candidate matches in sparse and wildcard matching
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tree pattern matching with a more general notion of occurrence of the pattern
Information Processing Letters
A Fast Tree Pattern Matching Algorithm for XML Query
WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Efficient algorithms for the tree homeomorphism problem
DBPL'07 Proceedings of the 11th international conference on Database programming languages
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 following tree pattern matching problem is considered: Given two unordered labeled trees P and T , find all occurrences of P in T . Here P and T are called a pattern tree and a target tree , respectively. We first introduce a new problem called the pseudo-tree pattern matching problem . Then we show two efficient bit-parallel algorithms for the pseudo-tree pattern matching problem. One runs in $O(L_P\cdot n\cdot l\cdot \lceil \frac{h}{W}\rceil)$ time and $O(n\cdot l\cdot \lceil \frac{h}{W}\rceil)$ space, and another one runs in $O((L_P\cdot n+h\cdot 2^l)\cdot \lceil \frac{h\cdot l}{W}\rceil)$ time and $O((n+h\cdot 2^l)\cdot \lceil \frac{h\cdot l}{W}\rceil)$ space, where n is the number of nodes in T , h and l are the height of P and the number of leaves of P , respectively, and W is the length of a computer-word. The parameter L P , called a recursive level of P , is defined to be the number of occurrences of the same label on a path from the root to a leaf. Hence we have L P ≤ h . Finally, we give an algorithm to extract all occurrences from pseud-occurrences in $O(n\cdot L_P\cdot l^{3/2})$ time and O (n ·L P ·l ) space.