A fast suffix automata based algorithm for exact online string matching

DOI10.1007/978-3-642-31606-7_13zbMATH Open1297.68279OpenAlexW100582606MaRDI QIDQ2914702FDOQ2914702

Authors: Simone Faro, Thierry Lecroq 

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_13

Recommendations

• The exact online string matching problem: a review of the most recent results
• Fast exact string matching algorithms
• Approximate string matching with suffix automata
• A New String Matching Algorithm
• Efficient online string matching based on characters distance text sampling

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Cites Work

• Fast Pattern Matching in Strings
• Title not available (Why is that?)
• A compact representation of nondeterministic (suffix) automata for the bit-parallel approach
• Fast exact string matching algorithms
• Alternative algorithms for bit-parallel string matching.

Cited In (14)

• Linear and efficient string matching algorithms based on weak factor recognition
• From nondeterministic suffix automaton to lazy suffix tree
• Efficient string matching based on a two-step simulation of the suffix automaton
• The Range Automaton: an efficient approach to text-searching
• Most Recent Match Queries in On-Line Suffix Trees
• A weak approach to suffix automata simulation for exact and approximate string matching
• A very fast string matching algorithm based on condensed alphabets
• The exact online string matching problem: a review of the most recent results
• An artificial neural network based approach for online string matching/filtering of large databases
• Compact suffix automata representations for searching long patterns
• Faster Online Elastic Degenerate String Matching
• Bit-Parallel Approximate Matching of Circular Strings with k Mismatches
• Efficient online string matching based on characters distance text sampling
• Byte-aligned pattern matching in encoded genomic sequences

This page was built for publication: A fast suffix automata based algorithm for exact online string matching

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