A variation on the Boyer-Moore algorithm
type: Item
instance of: scholarly article
title: A variation on the Boyer-Moore algorithm
zbMATH Open document ID: 0747.68023
DOI: 10.1016/0304-3975(92)90139-7
author: Thierry Lecroq
published in: Theoretical Computer Science
publication date: 1992-09-26T00:00:00Z
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 55522
zbMATH Keywords: longest prefix of the word
zbMATH Keywords: quadratic worst-case running time
zbMATH Keywords: linear- time algorithm
zbMATH Keywords: smallest suffix automaton
zbMATH Keywords: Boyer-Moore automaton
MaRDI profile type: Publication
full work available at URL: 0304-3975(92)90139-7
OpenAlex ID: W2100810239
cites work: Q4385510
cites work: The Boyer–Moore–Galil String Searching Strategies Revisited
cites work: On Boyer-Moore automata
cites work: The smallest automaton recognizing the subwords of a text
cites work: A fast string searching algorithm
cites work: Q3971281
cites work: Q3138957
cites work: Transducers and repetitions
cites work: On improving the worst case running time of the Boyer-Moore string matching algorithm
cites work: A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
cites work: Fast Pattern Matching in Strings
cites work: A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
description: scientific article; zbMATH DE number 55522