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

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

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

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

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)