A weak approach to suffix automata simulation for exact and approximate string matching

DOI10.1016/J.TCS.2022.08.028MaRDI QIDQ2676468zbMATH OpenOpenAlexFDO

Authors Simone Faro, Stefano Scafiti

Publication date 27 September 2022

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

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

zbMATH Keywords

automatadesign and analysis of algorithmsexact string matchingexperimental algorithmsswap matchingtext processing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Compact suffix automata representations for searching long patterns
• Approximate string matching with suffix automata
• A fast suffix automata based algorithm for exact online string matching
• Faster approximate string matching
• String range matching

Cites work

• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• A fast string searching algorithm
• A fast suffix automata based algorithm for exact online string matching
• A new algorithm for efficient pattern matching with swaps
• Alternative algorithms for bit-parallel string matching.
• Average complexity of exact and approximate multiple string matching
• Efficient string matching
• Fast and flexible packed string matching
• Fast and flexible string matching by combining bit-parallelism and suffix automata
• Fast exact string matching algorithms
• Fast Pattern Matching in Strings
• Fast string matching for DNA sequences
• scientific article; zbMATH DE number 1754502 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• Linear and efficient string matching algorithms based on weak factor recognition
• Multipattern string matching with q -grams
• Pattern Matching with Swaps for Short Patterns in Linear Time
• The exact online string matching problem: a review of the most recent results
• The Range Automaton: an efficient approach to text-searching

Cited in

(2)

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

This page was built for publication: A weak approach to suffix automata simulation for exact and approximate string matching

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