A variation on the Boyer-Moore algorithm (Q1190458)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A variation on the Boyer-Moore algorithm |
scientific article; zbMATH DE number 55522
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A variation on the Boyer-Moore algorithm |
scientific article; zbMATH DE number 55522 |
Statements
A variation on the Boyer-Moore algorithm (English)
0 references
26 September 1992
0 references
longest prefix of the word
0 references
quadratic worst-case running time
0 references
linear- time algorithm
0 references
smallest suffix automaton
0 references
Boyer-Moore automaton
0 references
0.8420867323875427
0 references
0.8420865535736084
0 references
0.8285053968429565
0 references
0.7949853539466858
0 references
