The wide window string matching algorithm

DOI10.1016/j.tcs.2004.12.002zbMath1070.68148OpenAlexW2028851090MaRDI QIDQ1770398

Binxing Fang, Jie Sui, Longtao He

Publication date: 6 April 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.002

zbMATH Keywords

String matchingBit parallelismReverse prefix automatonSuffix automatonWide window algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items

Bit-Parallel Approximate Matching of Circular Strings with k Mismatches, An artificial neural network based approach for online string matching/filtering of large databases, WEIGHTED AUTOMATA FOR FULL-TEXT INDEXING, Improving practical exact string matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variation on the Boyer-Moore algorithm
• Speeding up two string-matching algorithms
• Computing regularities in strings: a survey
• Transducers and repetitions
• Reducing space for index implementation.
• A fast string searching algorithm
• The Complexity of Pattern Matching for a Random String
• Fast Pattern Matching in Strings
• Jewels of Stringology
• Simple Optimal String Matching Algorithm
• String Processing and Information Retrieval
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Average case analysis of the Boyer‐Moore algorithm
• String Processing and Information Retrieval