메뉴 건너뛰기




Volumn 92, Issue 1, 1992, Pages 191-211

Approximate string-matching with q-grams and maximal matches

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--COMPUTATIONAL COMPLEXITY;

EID: 0027113212     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(92)90143-4     Document Type: Article
Times cited : (437)

References (26)
  • 5
    • 0002862696 scopus 로고
    • String matching with constraints
    • Lecture Notes in Computer Science, Springer, Berlin
    • (1988) Proc. MFCS'88 Symp. , vol.324 , pp. 44-58
    • Crochemore1
  • 11
    • 84918689555 scopus 로고    scopus 로고
    • P. Jokinen, J. Tarhio, and E. Ukkonen, A comparison of approximate string-matching algorithms, submitted.
  • 17
    • 0016942292 scopus 로고
    • A space-economical suffix tree construction algorithm
    • (1976) J. ACM , vol.23 , pp. 262-272
    • McCreight1
  • 19
    • 49149141669 scopus 로고
    • The theory and computation of evolutionary distances: pattern recognition
    • (1980) J. Algorithms , vol.1 , pp. 359-373
    • Sellers1
  • 25
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • (1974) J. ACM , vol.21 , pp. 168-173
    • Wagner1    Fisher2


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