메뉴 건너뛰기




Volumn 4835 LNCS, Issue , 2007, Pages 846-857

Space efficient indexes for string matching with don't cares

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; CHARACTER RECOGNITION; PATTERN MATCHING; QUERY PROCESSING;

EID: 38149062674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_73     Document Type: Conference Paper
Times cited : (20)

References (9)
  • 4
    • 0002743213 scopus 로고
    • String matching and other products
    • Massachusetts Institute of Technology, Cambridge, MA
    • Fischer, M.J., Paterson, M.S.: String matching and other products. In: Complexity of computation, vol. 7, pp. 113-125. Massachusetts Institute of Technology, Cambridge, MA (1974)
    • (1974) Complexity of computation , vol.7 , pp. 113-125
    • Fischer, M.J.1    Paterson, M.S.2
  • 7
    • 0016942292 scopus 로고
    • A Space-economical Suffix Tree Construction Algorithm
    • McCreight, E.M.: A Space-economical Suffix Tree Construction Algorithm. Journal of the ACM 23(2), 262-272 (1976)
    • (1976) Journal of the ACM , vol.23 , Issue.2 , pp. 262-272
    • McCreight, E.M.1


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