Compact suffix automata representations for searching long patterns

DOI10.1016/J.TCS.2022.11.005MaRDI QIDQ2699978zbMATH OpenOpenAlexFDO

Authors 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

automata based algorithmsbit-parallelism techniquedesign and analysis on algorithmsstring matchingsuffix automaton simulationtext processing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• A weak approach to suffix automata simulation for exact and approximate string matching
• A fast suffix automata based algorithm for exact online string matching
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Fast and flexible string matching by combining bit-parallelism and suffix automata

Cites work

• 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
• A weak approach to suffix automata simulation for exact and approximate string matching
• Alternative algorithms for bit-parallel string matching.
• Efficient string matching based on a two-step simulation of the suffix automaton
• Fast and flexible packed string matching
• Fast Packed String Matching for Short Patterns
• Fast Pattern Matching in Strings
• scientific article; zbMATH DE number 3949728 (Why is no real title available?)
• scientific article; zbMATH DE number 3471577 (Why is no real title available?)
• scientific article; zbMATH DE number 1490002 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• Introduction to algorithms.
• 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)

• A weak approach to suffix automata simulation for exact and approximate string matching
• CSA++: Fast Pattern Search for Large Alphabets

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

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