메뉴 건너뛰기




Volumn 4598 LNCS, Issue , 2007, Pages 482-492

An improved algorithm for tree edit distance incorporating structural linearity

Author keywords

Dynamic programming; RNA secondary structure comparison; Tree edit distance

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING;

EID: 37849033588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73545-8_47     Document Type: Conference Paper
Times cited : (2)

References (10)
  • 1
    • 0345861203 scopus 로고    scopus 로고
    • New algorithm for ordered tree-to-tree correction problem
    • Chen, W.: New algorithm for ordered tree-to-tree correction problem. Journal of Algorithms 40(2), 135-158 (2001)
    • (2001) Journal of Algorithms , vol.40 , Issue.2 , pp. 135-158
    • Chen, W.1
  • 3
    • 18544371778 scopus 로고    scopus 로고
    • Decomposition algorithms for the tree edit distance problem
    • Dulucq, S., Touzet, H.: Decomposition algorithms for the tree edit distance problem. Journal of Discrete Algorithms 3, 448-471 (2005)
    • (2005) Journal of Discrete Algorithms , vol.3 , pp. 448-471
    • Dulucq, S.1    Touzet, H.2
  • 9
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM 21(1), 168-173 (1974)
    • (1974) Journal of the ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 10
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing 18(6), 1245-1262 (1989)
    • (1989) SIAM Journal on Computing , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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