Compact suffix automata representations for searching long patterns

DOI10.1016/J.TCS.2022.11.005OpenAlexW4309676643MaRDI QIDQ2699978

Simone Faro, Stefano Scafiti

Publication date: 20 April 2023

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.005

zbMATH Keywords

string matchingtext processingautomata based algorithmsdesign and analysis on algorithmssuffix automaton simulationbit-parallelism technique

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast and flexible packed string matching
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Efficient string matching based on a two-step simulation of the suffix automaton
• A weak approach to suffix automata simulation for exact and approximate string matching
• 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

This page was built for publication: Compact suffix automata representations for searching long patterns