Skip to search formSkip to main contentSkip to account menu

Suffix automaton

In computer science, a suffix automaton or directed acyclic word graph is a finite automaton that recognizes the set of suffixes of a given string… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Approximate string matchingComputer scienceDeterministic acyclic finite state automatonFactor oracle

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Induction of Directed Acyclic Word Graph in a Bioinformatics Task
In this paper a new algorithm for the induction of a Directed Acyclic Word Graph (DAWG) is proposed. A DAWG can serve as a very… 
2013
2013
WallBreaker: overcoming the wall effect in similarity search
In this paper we present the WallBreaker system for similarity search as used in the String Similarity Search/Join Competition… 
2011
2011
Special factors and the combinatorics of suffix and factor automata
Review
2010
Review
2010
Interactive Visualization Techniques for Searching Temporal Categorical Data
Temporal data has always captured people's imagination. Large databases of temporal data contain temporal patterns that can lead… 
2008
2008
A new parameterized string matching algorithm by combining bit-parallelism and suffix automata
  • R. PrasadS. Agarwal
  • 8th IEEE International Conference on Computer and…
  • 2008
  • Corpus ID: 6383092
In the parameterized string matching, a given pattern P is said to match with a substring t of the text T, if there exist a… 
2006
2006
Compressed by the suffix tree
A close inspection of Fiala and Green's implementation of Ziv-Lempel'77 dictionary compression method reveals a surprising… 
2006
2006
Text Searching and Indexing
Although data is stored in various ways, text remains the main form of exchanging information. This is particularly evident in… 
2004
2004
A Trie-Based Approach for Compacting Automata
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from… 
2002
2002
DAWG versus suffix array
This paper shows a comparison of two data structures used for indexing of input texts. The first structure is the Suffix Array… 
2001
2001
Fast and Flexible String Matching by Combining Bit-parallelism and Suux Automata
The most important features of a string matching algorithm are its eeciency and its exibility. EEciency has traditionally… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)