A weak approach to suffix automata simulation for exact and approximate string matching
From MaRDI portal
Publication:2676468
DOI10.1016/J.TCS.2022.08.028OpenAlexW4294862165MaRDI QIDQ2676468
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
automataswap matchingtext processingexact string matchingexperimental algorithmsdesign and analysis of algorithms
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Fast and flexible packed string matching
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
- Fast exact string matching algorithms
- Average complexity of exact and approximate multiple string matching
- The Range Automaton: an efficient approach to text-searching
- Fast string matching for DNA sequences
- The exact online string matching problem
- A Fast Suffix Automata Based Algorithm for Exact Online String Matching
- A fast string searching algorithm
- Multipattern string matching with q -grams
- Pattern Matching with Swaps for Short Patterns in Linear Time
- A New Algorithm for Efficient Pattern Matching with Swaps
- Efficient string matching
- Fast Pattern Matching in Strings
- Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition
- Fast and flexible string matching by combining bit-parallelism and suffix automata
- String Processing and Information Retrieval
This page was built for publication: A weak approach to suffix automata simulation for exact and approximate string matching