Speeding up two string-matching algorithms
type: Item
instance of: scholarly article
title: Speeding up two string-matching algorithms
zbMATH Open document ID: 0942.68574
DOI: 10.1007/BF01185427
author: Maxime Crochemore
author: Leszek Gąsieniec
author: Wojciech Rytter
author: Artur Czumaj
author: Stefan Jarominek
author: Thierry Lecroq
author: Wojciech Plandowski
published in: Algorithmica
publication date: 1996-02-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68U15
Mathematics Subject Classification ID: 68P20
zbMATH DE Number: 672031
Wikidata QID: Q60163036
MaRDI profile type: Publication
cites work: Q4385510
cites work: The Boyer–Moore–Galil String Searching Strategies Revisited
cites work: Average running time of the Boyer-Moore-Horspool algorithm
cites work: Q4003168
cites work: The smallest automaton recognizing the subwords of a text
cites work: A fast string searching algorithm
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 variation on the Boyer-Moore algorithm
cites work: A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
cites work: The Complexity of Pattern Matching for a Random String
full work available at URL: https://doi.org/10.1007/bf01185427
OpenAlex ID: W1992020000
description: scientific article; zbMATH DE number 672031