The Range Automaton: an efficient approach to text-searching

DOI10.1007/978-3-030-85088-3_8OpenAlexW3198665784MaRDI QIDQ2140462

Stefano Scafiti, Simone Faro

Publication date: 20 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-85088-3_8

zbMATH Keywords

automatastring matchingtext processingexperimental algorithmsdesign and analysis of algorithms

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (max. 100)

A weak approach to suffix automata simulation for exact and approximate string matching ⋮ Improved characters distance sampling for online and offline text searching

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
• 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
• Fast Pattern Matching in Strings
• Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition
• String Processing and Information Retrieval

This page was built for publication: The Range Automaton: an efficient approach to text-searching