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

DOI10.1007/978-3-030-79121-6_14OpenAlexW3176281618MaRDI QIDQ2117677

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)

Related Items (1)

Compact suffix automata representations for searching long patterns

Cites Work

• Fast and flexible packed string matching
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• The exact online string matching problem
• A Fast Suffix Automata Based Algorithm for Exact Online String Matching
• A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
• Fast Pattern Matching in Strings
• Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition
• Fast Packed String Matching for Short Patterns
• String Processing and Information Retrieval
• Unnamed Item
• Unnamed Item

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