Fast String Searching

@article{Hume1991FastSS,
  title={Fast String Searching},
  author={Andrew Hume and Daniel Sunday},
  journal={Softw., Pract. Exper.},
  year={1991},
  volume={21},
  pages={1221-1248}
}
SUMMARY Since the Boyer-Moore algorithm was described in 1977, it has been the standard benchmark for the practical string search literature. Yet this yardstick compares badly with current practice. We describe two algorithms that perform 47% fewer comparisons and are about 4.5 times faster across a wide range of architectures and compilers. These new variants are members of a family of algorithms based on the skip loop structure of the preferred, but often neglected, fast form of Boyer-Moore… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 114 CITATIONS, ESTIMATED 99% COVERAGE

Experiments on string matching in memory structuresThierry

VIEW 13 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Technology beats algorithms (in exact string matching)

  • Softw., Pract. Exper.
  • 2016
VIEW 7 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Improved Two-Way Bit-parallel Search

  • Stringology
  • 2014
VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

String matching with lookahead

  • Discrete Applied Mathematics
  • 2014
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Continual process improvement based on reference models and process mining

VIEW 5 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Improving practical exact string matching

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

On the shift-table in Boyer-Moore's String Matching Algorithm

  • JDCTA
  • 2009
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Tuning BNDM with q-Grams

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1989
2019

CITATION STATISTICS

  • 19 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-8 OF 8 REFERENCES

On the exact complexity of string matching

  • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990

A tale of two greps,

A. Hume
  • Software—Practice and Experience 18,
  • 1988

and D

B. W. Kernigha
  • M. Ritchie, The C Programming Language, Prentice Hall, Englewood Cliffs, NJ,
  • 1988

More pep for Boyer-Moore grep, Usenet netnews group net.unix (March 18 1986)

J. A. Woods
  • Also Usenet archive comp. sources. unix,
  • 1987

A comparison of three string matching algorithms,

G.D.V. Smit
  • Software—Practice and Experience
  • 1982
VIEW 1 EXCERPT

Personal communication . J . J . Dongarra and E . Grosse , ‘ Distribution of mathematical software via electronic mail

C. Burks
  • Comm . ACM
  • 1980