Abstract
There are many strategies for searching for a pattern in a string. And there exist many papers on this topic. This paper does not present a new pattern-matching algorithm but offers a survey of well-known algorithms and compares their run-time behavior. The theoretical background of the pattern-matching algorithms is discussed in several books on algorithms. In contrast to these general considerations, the algorithms are compared by measuring the behavior of typical examples.
| Original language | English |
|---|---|
| Pages (from-to) | 89-98 |
| Number of pages | 10 |
| Journal | Structured Programming |
| Volume | 13 |
| Publication status | Published - May 1992 |
Fields of science
- 102 Computer Sciences
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver