boyer-gosper-moore

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.
academic, performance, parsing

Sign in to change this factoid.