메뉴 건너뛰기




Volumn 26, Issue 2, 1997, Pages 560-562

Structural Matching and Discovery in Document Databases

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER ARCHITECTURE; DATA ACQUISITION; DATA STRUCTURES; DIGITAL STORAGE; GRAPHICAL USER INTERFACES; INFORMATION MANAGEMENT; INFORMATION RETRIEVAL; TREES (MATHEMATICS); WIDE AREA NETWORKS;

EID: 0031168922     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/253262.253406     Document Type: Article
Times cited : (15)

References (14)
  • 9
    • 0001495763 scopus 로고
    • Fast algorithms for the unit cost editing distance between trees
    • D. Shasha and K. Zhang. Fast algorithms for the unit cost editing distance between trees. Journal of Algorithms, 11(4):581-621, 1990.
    • (1990) Journal of Algorithms , vol.11 , Issue.4 , pp. 581-621
    • Shasha, D.1    Zhang, K.2
  • 11
    • 0022100234 scopus 로고
    • RCS: A system for version control
    • July
    • W. Tichy. RCS: A system for version control. Software - Practice and Experience, 15(7):637-654, July 1985.
    • (1985) Software - Practice and Experience , vol.15 , Issue.7 , pp. 637-654
    • Tichy, W.1
  • 14
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • Dec.
    • K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal on Computing, 18(6):1245-1262, Dec. 1989.
    • (1989) SIAM Journal on Computing , vol.18 , Issue.6 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2


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