A bit-parallel tree matching algorithm for patterns with horizontal VLDC's

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3772 LNCS, Issue , 2005, Pages 388-398

  Tsuji, Hisashi ^a   Ishino, Akira ^a   Takeda, Masayuki ^a,b  

^a KYUSHU UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BIT-PARALLEL TREE MATCHING ALGORITHM; CONSECUTIVE SIBLINGS; TREE PATTERN MATCHING PROBLEM; XML DOCUMENTS;

COMPUTATIONAL COMPLEXITY; INFORMATION RETRIEVAL; PATTERN MATCHING; PROBLEM SOLVING; TREES (MATHEMATICS); XML;

ALGORITHMS;

EID: 33646720695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11575832_43     Document Type: Conference Paper

References (20)

1. P. C. Amoth, T. R. and P. Tadepalli. Exact learning of tree patterns from queries and counterexamples. In Proceedings of COLT '98, pages 175-186, 1998.
2. D. Angluin. Finding patterns common to a set of strings. J. Comput. Sys. Sci., 21:46-62, 1980.
3. C. Chauve. Tree pattern matching with a more general notion of occurrence of the pattern. Inform. Process. Lett., 82:197-201, 2002.
4. 3 n)-time. In STOC'97, pages 66-75, 1997.
5. R. Cole, R. Hariharan, and P. Indyk. Tree pattern matching and subset matching in deterministic O(n log n)-time. In SODA'99, pages 245-254, 1999.
6. M. Dubliner, Z. Galil, and E. Magen. Faster tree pattern matching. J. ACM, 41(2):205-213, 1994.
7. F. N. Geert Jan Bex, Sebastian Maneth. A formal model for an expressive fragment of xslt. In Proceedings of CL 2000 (LNAI 1861), pages 1137-1151, 2000.
8. C. M. Hoffmann and M. J. O'Donnell. Pattern matching in trees. J. ACM, 29(1):68-95, 1982.
9. P. Kilpeläinen. Tree Matching Problems with Applications to Structured Text Databases. PhD thesis, Dept. of Computer Science, University of Helsinki, 1992.
10. P. Kilpeläinen and H. Mannila. Ordered and unordered tree inclusion. SIAM J. Comput., 24(2):340-356, 1995.
11. S. R. Kosaraju. Efficient tree pattern matching. In FOCS'89, pages 178-183. IEEE Comput. Soc. Press, 1989.
12. F. Luccio and L. Pagli. An efficient algorithm for some tree matching problems. Inform. Process. Lett., 39(1):51-57, 1991.
13. F. Luccio and L. Pagli. Approximate matching for two families of trees. Information and Computation, 123(1):111-120, 1995.
14. M. Murata. Transformation of documents and schemas by patterns and contextual conditions. In Proceedings of Document Processing '96 (LNCS 1293), pages 153-169, 1997.
15. M. Murata. Data model for document transformation and assembly (extended abstract), pages 140-152, 1998.
16. G. Navarro and M. Raffinot. Flexible pattern matching in strings: Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge, 2002.
17. M. Nivat and H. Ait-Kaci. On recognizable sets and tree automata. In Resolution of Equations in Algebraic Structres. 1989.
18. T. Shoudai, T. Uchida, and T. Miyahara. Polynomial time algorithms for finding unordered tree patterns with internal variables. In FCT'01, pages 335-346, 2001.
19. M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 27:1-36, 1975.
20. K. Zhang, D. Shasha, and J. T. L. Wang. Approximate tree matching in the presence of variable length don't cares. J. Algorithms, 16(1):33-66, 1994.