Fast Pattern Matching in Strings
Explore this paper's citation graph
Summary
An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language α α ^R^*, can be recognized in linear time.
- Type
- article
- Published
- 1977-06-01
- Cited by
- 3,290
- References
- 24
- OpenAlex
- https://openalex.org/W1985108724
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:11697579
Keywords
String searching algorithm, Algorithm, Pattern matching, Mathematics, Matching (statistics)
References
- MITのArtificial Intelligence Laboratory
- STRING-MATCHING AND OTHER PRODUCTS
- Linear Time Simulation of Deterministic Two-Way Pushdown Automata
- The Design and Analysis of Computer Algorithms
- Uniqueness theorems for periodic functions
- Sur une question de Jean Bernoulli
- On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition
- Implementation of the substring test by hashing
- On the Translation of Languages from Left to Right
- A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
- Synchronization of binary messages
- A fast string searching algorithm
- Structured Programming with go to Statements
- Elementary number theory
- Rapid identification of repeated patterns in strings, trees and arrays
- Linear Pattern Matching Algorithms
- The Art of Computer Programming
- E2307
- Elementary Number Theory.
- The art of computer programming. Vol.1: Fundamental algorithms
Cited by
- Algorithmique parallèle du texte : du modèle systolique au modèle CGM
- Hardware acceleration of network intrusion detection and prevention
- An enhanced sub image matching algorithm for binary images
- Partial evaluation of lazy functional logic programs: Thesis
- Reconfigurable processing architectures for stream processing and hybrid computing
- Parsing with Prefix and Suffix Dictionaries.
- SNP and mutation discovery using base-specific cleavage and MALDI-TOF mass spectrometry
- Prospects and limitations of full-text index structures in genome analysis
- Suffix trees and their applications in string algorithms
- On Succinct Representations of Textured Surfaces by Weighted Finite Automata
- Tight bounds for data stream algorithms and communication problems
- Geometric Point Pattern Matching in the Knuth-Morris-Pratt Way
- An Efficient Algorithm for Recognizing the Forward-Branching Class of Term-Rewriting Systems
- Narrowing-driven Specialization of Functional Logic Programs
- Program and Data Specialization Principles, Applications, and Self-Application
- Border Array on Bounded Alphabet
- Mitigating Botnet-based DDoS Attacks against Web Servers
- BioSuite: a comprehensive bioinformatics software package (A unique industry-academia collaboration)
- Robust String Matching in O(√N+M) Quantum Queries
- Automatic Malware Signature Generation
Related papers
- Computer Algorithms: String Pattern Matching Strategies
- Two Improved Fast Single Pattern Matching Algorithms of QS
- A single-pattern matching algorithm base on twice jumps in the intrusion detection systems
- A New pattern matching algorithm and parallelization design in IDS
- Largest Shift String Matching Algorithm: Blend of Berry Ravindran, Zhu-Takaoka and Back & Forth Matching Algorithm
- Two-way Comparative Pattern Matching Algorithm Suitable for Chinese
- Improved BM Pattern Matching Algorithm
- A Fast Exact Pattern Matching Algorithm for Biological Sequences
- Average time complexity analysis of Commentz-Walter algorithm
- On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition