Worst-case behavior of string-searching algorithms

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

If some conditions hold for the string pattern, then in the worst case every string-searching algorithm has to examine all the characters of the text. These conditions hold for more than half of the patterns consisting of 0's and 1's.

Original languageEnglish
Pages (from-to)99-103
Number of pages5
JournalJournal of Statistical Planning and Inference
Volume6
Issue number1
DOIs
Publication statusPublished - 1982

Keywords

  • String-searching
  • Worst-case behavior

ASJC Scopus subject areas

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Worst-case behavior of string-searching algorithms'. Together they form a unique fingerprint.

  • Cite this