메뉴 건너뛰기




Volumn 3, Issue 2-4, 2005, Pages 448-471

Decomposition algorithms for the tree edit distance problem

Author keywords

Algorithm; Alignment; Computational biology; Edit distance; Tree

Indexed keywords

ALGORITHMS; ALIGNMENT; COMPUTER SCIENCE; DATA ACQUISITION; DYNAMIC PROGRAMMING; PROBLEM SOLVING;

EID: 18544371778     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.08.018     Document Type: Conference Paper
Times cited : (26)

References (14)
  • 2
    • 0041387617 scopus 로고    scopus 로고
    • RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm
    • S. Dulucq, and L. Tichit RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm Theoret. Comput. Sci. 306 1-3 2003 471 484
    • (2003) Theoret. Comput. Sci. , vol.306 , Issue.1-3 , pp. 471-484
    • Dulucq, S.1    Tichit, L.2
  • 3
    • 0021426157 scopus 로고
    • Fats algorithms for finding nearest common ancestors
    • D. Harel, and R.E. Tarjan Fats algorithms for finding nearest common ancestors SIAM J. Comput. 13 2 1984 338 355
    • (1984) SIAM J. Comput. , vol.13 , Issue.2 , pp. 338-355
    • Harel, D.1    Tarjan, R.E.2
  • 4
    • 0029309548 scopus 로고
    • Alignment of trees - An alternative to tree edit
    • T. Jiang, L. Wang, and K. Zhang Alignment of trees - an alternative to tree edit Theor. Comput. Sci. 143 1995
    • (1995) Theor. Comput. Sci. , vol.143
    • Jiang, T.1    Wang, L.2    Zhang, K.3
  • 6
    • 0014757386 scopus 로고
    • A general method applicable to the search for similarities in the amino acid sequence of two proteins
    • S.B. Needleman, and C.D. Wunsh A general method applicable to the search for similarities in the amino acid sequence of two proteins J. Molecular Biol. 48 1970 443 453
    • (1970) J. Molecular Biol. , vol.48 , pp. 443-453
    • Needleman, S.B.1    Wunsh, C.D.2
  • 7
    • 0001122858 scopus 로고
    • The tree-to-tree editing problem
    • S.M. Selkow The tree-to-tree editing problem Inform. Process. Lett. 6 1977 184 186
    • (1977) Inform. Process. Lett. , vol.6 , pp. 184-186
    • Selkow, S.M.1
  • 8
    • 0024061490 scopus 로고
    • Comparing multiple RNA secondary structures using tree comparisons
    • B. Shapiro, and K. Zhang Comparing multiple RNA secondary structures using tree comparisons Comput. Appl. Biosci. 4 3 1988 387 393
    • (1988) Comput. Appl. Biosci. , vol.4 , Issue.3 , pp. 387-393
    • Shapiro, B.1    Zhang, K.2
  • 9
    • 0018491659 scopus 로고
    • The tre-to-tree correction problem
    • K.C. Tai The tre-to-tree correction problem J. ACM 26 1979 422 433
    • (1979) J. ACM , vol.26 , pp. 422-433
    • Tai, K.C.1
  • 10
    • 0037435789 scopus 로고    scopus 로고
    • Tree edit distance with gaps
    • H. Touzet Tree edit distance with gaps Inform. Process. Lett. 85 3 2003 123 129
    • (2003) Inform. Process. Lett. , vol.85 , Issue.3 , pp. 123-129
    • Touzet, H.1
  • 12
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • R.A. Wagner, and M.J. Fischer The string-to-string correction problem J. ACM 21 1 1974 168 173
    • (1974) J. ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 13
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • K. Zhang, and D. Shasha Simple fast algorithms for the editing distance between trees and related problems SIAM J. Comput. 18 6 1989 1245 1262
    • (1989) SIAM J. Comput. , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2
  • 14
    • 0029267579 scopus 로고
    • Algorithms for the constrained editing problem between ordered labeled trees and related problems
    • K. Zhang Algorithms for the constrained editing problem between ordered labeled trees and related problems Pattern Recognition 28 1995 463 474
    • (1995) Pattern Recognition , vol.28 , pp. 463-474
    • Zhang, K.1


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