Efficient string matching based on a two-step simulation of the suffix automaton

DOI10.1007/978-3-030-79121-6_14MaRDI QIDQ2117677zbMATH OpenOpenAlexFDO

Authors Simone Faro, Stefano Scafiti

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79121-6_14

zbMATH Keywords

string matchingtext processingautomata based algorithmsdesign and analysis on algorithmssuffix automaton simulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 2185629 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A fast suffix automata based algorithm for exact online string matching
• Alternative algorithms for bit-parallel string matching.
• Fast Packed String Matching for Short Patterns
• Fast Pattern Matching in Strings
• Fast and flexible packed string matching
• Linear and efficient string matching algorithms based on weak factor recognition
• The exact online string matching problem: a review of the most recent results

Cited in

(2)

• Approximate string matching with suffix automata
• Compact suffix automata representations for searching long patterns

This page was built for publication: Efficient string matching based on a two-step simulation of the suffix automaton

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