메뉴 건너뛰기




Volumn 2906, Issue , 2003, Pages 230-239

Approximate regular expression searching with arbitrary integer weights

Author keywords

[No Author keywords available]

Indexed keywords

INTRUSION DETECTION;

EID: 26444539346     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_25     Document Type: Article
Times cited : (4)

References (13)
  • 2
    • 0022989344 scopus 로고
    • From regular expression to deterministic automata
    • G. Berry and R. Sethi. From regular expression to deterministic automata. Theor. Comp. Sci., 48(1):117-126, 1986.
    • (1986) Theor. Comp. Sci. , vol.48 , Issue.1 , pp. 117-126
    • Berry, G.1    Sethi, R.2
  • 3
    • 0002833962 scopus 로고
    • The abstract theory of automata
    • V. Glushkov. The abstract theory of automata. Russ. Math. Surv., 16:1-53, 1961.
    • (1961) Russ. Math. Surv. , vol.16 , pp. 1-53
    • Glushkov, V.1
  • 4
    • 0026845596 scopus 로고
    • A four-russian algorithm for regular expression pattern matching
    • E. Myers. A four-russian algorithm for regular expression pattern matching. J. of the ACM, 39(2):430-448, 1992.
    • (1992) J. of the ACM , vol.39 , Issue.2 , pp. 430-448
    • Myers, E.1
  • 5
    • 0024597485 scopus 로고
    • Approximate matching of regular expressions
    • E. Myers and W. Miller. Approximate matching of regular expressions. Bull. Math. Biol., 51:7-37, 1989.
    • (1989) Bull. Math. Biol. , vol.51 , pp. 7-37
    • Myers, E.1    Miller, W.2
  • 6
    • 0035841458 scopus 로고    scopus 로고
    • Nr-grep: A fast and flexible pattern matching tool
    • G. Navarro. Nr-grep: a fast and flexible pattern matching tool. Software Practice and Experience, 31:1265-1312, 2001.
    • (2001) Software Practice and Experience , vol.31 , pp. 1265-1312
    • Navarro, G.1
  • 8
    • 78650718168 scopus 로고    scopus 로고
    • Compact DFA representation for fast regular expression search
    • Proc. WAE'01
    • G. Navarro and M. Raffinot. Compact DFA representation for fast regular expression search. In Proc. WAE'01, LNCS 2141, pages 1-12, 2001.
    • (2001) LNCS , vol.2141 , pp. 1-12
    • Navarro, G.1    Raffinot, M.2
  • 9
    • 49149141669 scopus 로고
    • The theory and computation of evolutionary distances: Pattern recognition
    • P. Sellers. The theory and computation of evolutionary distances: Pattern recognition. J. of Algorithms, 1(4):359-373, 1980.
    • (1980) J. of Algorithms , vol.1 , Issue.4 , pp. 359-373
    • Sellers, P.1
  • 10
    • 84945708555 scopus 로고
    • Regular expression search algorithm
    • K. Thompson. Regular expression search algorithm. CACM, 11(6):419-422, 1968.
    • (1968) CACM , vol.11 , Issue.6 , pp. 419-422
    • Thompson, K.1
  • 11
    • 0000386785 scopus 로고
    • Finding approximate patterns in strings
    • E. Ukkonen. Finding approximate patterns in strings. J. of Algorithms, 6:132-137, 1985.
    • (1985) J. of Algorithms , vol.6 , pp. 132-137
    • Ukkonen, E.1
  • 12
    • 84976654685 scopus 로고
    • Fast text searching allowing errors
    • S. Wu and U. Manber. Fast text searching allowing errors. CACM, 35(10):83-91, 1992.
    • (1992) CACM , vol.35 , Issue.10 , pp. 83-91
    • Wu, S.1    Manber, U.2
  • 13
    • 0344005044 scopus 로고
    • A subquadratic algorithm for approximate regular expression matching
    • S. Wu, U. Manber, and E. Myers. A subquadratic algorithm for approximate regular expression matching. J. of Algorithms, 19(3):346-360, 1995.
    • (1995) J. of Algorithms , vol.19 , Issue.3 , pp. 346-360
    • Wu, S.1    Manber, U.2    Myers, E.3


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