메뉴 건너뛰기
Acta Informatica
Volumn 37, Issue 9, 2001, Pages 653-670
On the tree inclusion problem
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0035354489     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013317     Document Type: Article
Times cited : (4)
References (10)
  • 1
    • 85027613477 scopus 로고
    • More efficient bottom-up tree pattern matching
    • LNCS Berlin Heidelberg New York: Springer
    • 1. J. Cai, R. Paige, R. Tarjan: More efficient bottom-up tree pattern matching, Proc. CAAP'90, LNCS 431, pp. 72-86, Berlin Heidelberg New York: Springer 1990
    • (1990) Proc. CAAP'90 , vol.431 , pp. 72-86
    • Cai, J.1    Paige, R.2    Tarjan, R.3
  • 4
    • 0019899359 scopus 로고
    • Pattern matching in trees
    • 4. C.M. Huffman, M.J. O'Donnell: Pattern matching in trees, J.A.C.M 29, 68-95 (1992)
    • (1992) J.A.C.M , vol.29 , pp. 68-95
    • Huffman, C.M.1    Donnell, M.J.2
  • 5
    • 85029600102 scopus 로고
    • The tree inclusion problem
    • LNCS Berlin Heidelberg New York: Springer
    • 5. P. Kilpelinen, H. Mannila: The tree inclusion problem, Proc. of CAAP'91, LNCS 493, pp. 202-214, Berlin Heidelberg New York: Springer 1991
    • (1991) Proc. of CAAP'91 , vol.493 , pp. 202-214
    • Kilpelinen, P.1    Mannila, H.2
  • 6
    • 0000889116 scopus 로고
    • Query primitives for tree structured data
    • LNCS Berlin Heidelberg New York: Springer
    • 6. P. Kilpelinen, H. Mannila: Query primitives for tree structured data, Proc. of CPM 94, LNCS 897, pp. 213-225, Berlin Heidelberg New York: Springer 1994
    • (1994) Proc. of CPM 94 , vol.897 , pp. 213-225
    • Kilpelinen, P.1    Mannila, H.2
  • 7
    • 0029291968 scopus 로고
    • Ordered and unordered tree inclusion
    • 7. P. Kilpelinen, H. Mannila: Ordered and unordered tree inclusion, SIAM J. Cumput. 24(2), 34-356 (1995)
    • (1995) SIAM J. Cumput. , vol.24 , Issue.2 , pp. 34-356
    • Kilpelinen, P.1    Mannila, H.2
  • 8
    • 0007117259 scopus 로고
    • The art of computer pragramming
    • Reading Mass.: Addison Wesley
    • 8. D.E. Knuth: The art of computer pragramming, Fundamental Algorithms, volume 1. Reading Mass.: Addison Wesley 1973
    • (1973) Fundamental Algorithms , vol.1
    • Knuth, D.E.1
  • 9
    • 0024889169 scopus 로고
    • Simple fast algorithms for editiong distance between trees and related problems
    • 9. K. Zhang, D. Shasha: Simple fast algorithms for editiong distance between trees and related problems, SIAM J. Comp. 18, 1245-1262 (1989)
    • (1989) SIAM J. Comp. , vol.18 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2
  • 10
    • 0001495763 scopus 로고
    • Fast algorithms for the unit cost editing distance between trees
    • 10. K. Zhang, D. Shasha: Fast Algorithms for the Unit Cost Editing Distance between Trees, J. Algorithms 11, 581-621 (1990)
    • (1990) J. Algorithms , vol.11 , pp. 581-621
    • Zhang, K.1    Shasha, D.2

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.