More efficient algorithm for ordered tree inclusion

Journal of Algorithms

Volumn 26, Issue 2, 1998, Pages 370-385

  Chen, Weimin ^a  

^a FRAUNHOFER IPSI   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1542594159     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0899     Document Type: Article

References (11)

1. L. Alonso and R. Schott, On the tree Inclusion Problem, in "Proceedingsof Mathematical Foundationsof Computer Science, 1993," pp. 211-221.
2. G. H. Gonnet and F. Wm. Tompa, Mind your grammar - a new approach to text databases, in "Proceedings of the Conference on Very Large Data Bases (VLD B'87)" pp. 339-346, Morgan Kaufman, Brighton, 1987.
3. P. Kilpeläinen, "Tree Matching Problemswith Applicationsto Structured Text Database," Ph.D. thesis, Univ. of Helsinki, Dept. of Computer Science, Nov., 1992.
4. P. Kilpeläinen and H. Mannila, Ordered and unordered tree inclusion, SIAM J. Comput., 24 (1995), 340-356.
5. D. E. Knuth, "The Art of Computer Programming," Vol. 1, Addison-Wesley, Reading, MA, 1969.
6. H. Mannila and K.-J. Räiha, On query languages for the p-string data model, in "Information Modelling and Knowledge Bases" (H. Kangassalo, S. Ohsuga, and H. Jaakkola, Eds.), pp. 469-482, IDS Press, Amsterdam, 1990.
7. D. Shasha and K. Zhang, Fast algorithm for the unit cost editing distance between trees, J. Algorithms 11 (1990), 581-621.
8. J. Tague, A. Salminen, and C. McClellan, Complete formal model for information retrieval systems, in "Proceedingsof the 14th Annual International ACM/SIGIR Conference on Research and Development in Information Retrieval," pp. 14-20, Assoc. Comput. Mach., New York, 1991.
9. K.-C. Tai, The tree-to-tree correction problem, J. ACM, 26 (1979), 422-433.
10. J. Matoušek and R. Thomas, On the complexity of finding iso- and other morphisms for partial k-trees, Discrete Mathematics, 108 (1992), 343-364.
11. K. Zhang and D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM J. Comput. 18 (1989), 1245-1262.