The wide window string matching algorithm
type: Item
instance of: scholarly article
title: The wide window string matching algorithm
zbMATH Open document ID: 1070.68148
author: Longtao He
author: Binxing Fang
author: Jie Sui
published in: Theoretical Computer Science
publication date: 2005-04-06T00:00:00Z
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 2153193
zbMATH Keywords: Suffix automaton
zbMATH Keywords: Reverse prefix automaton
zbMATH Keywords: Bit parallelism
zbMATH Keywords: Wide window algorithm
zbMATH Keywords: String matching
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.12.002
OpenAlex ID: W2028851090
cites work: Simple Optimal String Matching Algorithm
cites work: A fast string searching algorithm
cites work: Q3570040
cites work: Transducers and repetitions
cites work: Q4347080
cites work: Reducing space for index implementation.
cites work: Speeding up two string-matching algorithms
cites work: Q4849531
cites work: Jewels of Stringology
cites work: String Processing and Information Retrieval
cites work: Fast Pattern Matching in Strings
cites work: A variation on the Boyer-Moore algorithm
cites work: Fast and flexible string matching by combining bit-parallelism and suffix automata
cites work: Q4534878
cites work: Computing regularities in strings: a survey
cites work: Average case analysis of the Boyer‐Moore algorithm
cites work: The Complexity of Pattern Matching for a Random String
DOI: 10.1016/J.TCS.2004.12.002
description: scientific article; zbMATH DE number 2153193