Worst-case behavior of string-searching algorithms |
| |
| Authors: | Zsolt Tuza |
| |
| Institution: | Computer and Automation Institute of the Hungarian Academy of Sciences, Budapest, Hungary |
| |
| 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. |
| |
| Keywords: | Primary: 68A10 02E10 Secondary: 05-04 String-searching Worst-case behavior |
| 本文献已被 ScienceDirect 等数据库收录！ |
