메뉴 건너뛰기




Volumn 23, Issue 9, 2001, Pages 929-946

On the pattern recognition of noisy subsequence trees

Author keywords

Noisy subsequence trees; Syntactic pattern recognition; Tree and subtree recognition

Indexed keywords

SUBTREE RECOGNITION; SYNTACTIC PATTERN RECOGNITION;

EID: 0035441166     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.955108     Document Type: Article
Times cited : (8)

References (23)
  • 2
    • 4243962192 scopus 로고
    • Ordered and unordered tree inclusion
    • Technical Report A-1991-4, Dept. of Computer Science, Univ. of Helsinki, Aug.; to appear in SIAM J. Computing
    • (1991)
    • Kilpelainen, P.1    Mannila, H.2
  • 16
    • 0018491659 scopus 로고
    • The tree-to-tree correction problem
    • (1979) J. ACM , vol.26 , pp. 422-433
    • Tai, K.C.1


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