Submit

Back to the knowledge base

boyer-gosper-moore

By jottinger · · 291 lookups

Text
boyer-gosper-moore is a string-search algorithm that compares right to left and skips ahead via bad-character and good-suffix tables; Gosper found it independently. Best on long patterns.
Tags
academic performance parsing

to change this factoid.

Search posts