메뉴 건너뛰기




Volumn , Issue , 1995, Pages 541-550

Parameterized pattern matching by boyer-moore-type algorithms

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETERIZATION; PATTERN MATCHING;

EID: 85012147541     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (48)

References (17)
  • 1
    • 0028381833 scopus 로고
    • Alphabet dependence in parameterized match- ing
    • Amihood Amir, Martin Farach, and S. Muthukrishnan. Alphabet dependence in parameterized match- ing. Info. Proc. Letters, 49:111-115, 1994.
    • (1994) Info. Proc. Letters , vol.49 , pp. 111-115
    • Amir, A.1    Farach, M.2    Muthukrishnan, S.3
  • 2
    • 85039799259 scopus 로고    scopus 로고
    • Parameterized pattern matching: Algorithms and applications
    • to appear
    • Brenda S. Baker. Parameterized pattern matching: algorithms and applications. J. Comput. Syst. Sci. to appear.
    • J. Comput. Syst. Sci.
    • Baker, B.S.1
  • 5
    • 0027227137 scopus 로고
    • A theory of parameterized pattern matching: Algorithms and applications
    • San Diego, California
    • Brenda S. Baker. A theory of parameterized pattern matching: Algorithms and applications. In Proceedings of the 25th Annual Symposium on Theory of Computing, pages 71-80, San Diego, California, 1993.
    • (1993) Proceedings of the 25th Annual Symposium on Theory of Computing , pp. 71-80
    • Baker, B.S.1
  • 6
    • 0017547820 scopus 로고
    • A fast string searching algorithm
    • October
    • Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, October 1977.
    • (1977) Commun. ACM , vol.20 , Issue.10 , pp. 762-772
    • Boyer, R.S.1    Moore, J.S.2
  • 8
    • 0027113176 scopus 로고
    • Average running time of the Boyer-Moore-Horspool algorithm
    • Ricardo A. Baeza-Yates and Mireille Régnier. Average running time of the Boyer-Moore-Horspool algorithm. Theoretical Computer Sci., 92:19-31, 1992.
    • (1992) Theoretical Computer Sci. , vol.92 , pp. 19-31
    • Baeza-Yates, R.A.1    Régnier, M.2
  • 11
    • 84984028908 scopus 로고
    • Practical fast searching in strings
    • R. Nigel Horspool. Practical fast searching in strings. Soft. Pract. and Exp., 10:501-506, 1980.
    • (1980) Soft. Pract. and Exp. , vol.10 , pp. 501-506
    • Horspool, R.N.1
  • 12
    • 0026260755 scopus 로고
    • Fast string searching
    • Andrew Hume and Daniel Sunday. Fast string searching. Soft. Pract. and Exp., 21(11):1221-1248, 1991.
    • (1991) Soft. Pract. and Exp. , vol.21 , Issue.11 , pp. 1221-1248
    • Hume, A.1    Sunday, D.2
  • 14
  • 15
    • 0000839459 scopus 로고
    • A correct preprocessing algorithm for Boyer-Moore string-searching
    • August
    • Wojciech Rytter. A correct preprocessing algorithm for Boyer-Moore string-searching. SIAM J. Comput, 9(3):509-512, August 1980.
    • (1980) SIAM J. Comput , vol.9 , Issue.3 , pp. 509-512
    • Rytter, W.1
  • 16
    • 0024057424 scopus 로고
    • On the expected sublinearity of the Boyer-Moore algorithm
    • August
    • R. Schaback. On the expected sublinearity of the Boyer-Moore algorithm. SIAM J. on Comput, 17(4):648-659, August 1988.
    • (1988) SIAM J. on Comput , vol.17 , Issue.4 , pp. 648-659
    • Schaback, R.1
  • 17
    • 0025467860 scopus 로고
    • A very fast substring search algorithm
    • August
    • Daniel M. Sunday. A very fast substring search algorithm. Commun. ACM, 33(8): 132-139, August 1990.
    • (1990) Commun. ACM , vol.33 , Issue.8 , pp. 132-139
    • Sunday, D.M.1


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