String-matching on ordered alphabets

DOI10.1016/0304-3975(92)90134-2zbMATH Open0747.68021OpenAlexW2076967798MaRDI QIDQ1190451FDOQ1190451

Authors: Maxime Crochemore 

Publication date: 26 September 1992

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

Full work available at URL: https://doi.org/10.1016/0304-3975(92)90134-2

Recommendations

• Publication:3468609
• scientific article; zbMATH DE number 1615293
• The zooming method: A recursive approach to time-space efficient string-matching
• A New String Matching Algorithm
• Simple Optimal String Matching Algorithm

zbMATH Keywords

linear time algorithmstring-matching algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Cites Work

• Two-way string-matching
• Factorizing words over an ordered alphabet
• A fast string searching algorithm
• Fast Pattern Matching in Strings
• Time-space-optimal string matching
• Title not available (Why is that?)
• String Matching in Real Time
• Optimal parallel detection of squares in strings
• Title not available (Why is that?)

Cited In (22)

• A note on a simple computation of the maximal suffix of a string
• A New String Matching Algorithm
• Quantum algorithm for lexicographically minimal string rotation
• Saving comparisons in the Crochemore-Perrin string-matching algorithm
• Engineering a lightweight external memory suffix array construction algorithm
• Non-overlapping indexing -- cache obliviously
• Simple real-time constant-space string matching
• On maximal suffixes and constant-space linear-time versions of KMP algorithm.
• Simple real-time constant-space string matching
• Center and distinguisher for strings with unbounded alphabet
• An algorithmic toolbox for periodic partial words
• Improved pattern-scan-order algorithms for string matching
• String matching with simple devices
• Squares, cubes, and time-space efficient string searching
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• How the character comparison order shapes the shift function of on-line pattern matching algorithms
• Enhanced string factoring from alphabet orderings
• Efficient parameterized pattern matching in sublinear space
• Non-overlapping indexing in BWT-runs bounded space
• Title not available (Why is that?)

This page was built for publication: String-matching on ordered alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190451)