Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Blumer et al. showed (cf. [3,2]) that the suffix automaton of a word w must have at least |w|+1 states and at most 2|w|-1 states… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string… Expand
  • figure 1
  • figure 2
Is this relevant?
2005
2005
Theapproximate string matching problem is, given a text string, a pattern string, and an integerk, to find in the text all… Expand
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2004
2004
We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
This paper shows a comparison of two data structures used for indexing of input texts. The first structure is the Suffix Array… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The most important features of a string matching algorithm are its efficiency and its flexibility. Efficiency has traditionally… Expand
  • figure 14
  • figure 16
  • figure 19
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The Directed Acyclic Word Graph (DAWG) is an efficient data structure to treat and analyze repetitions in a text, especially in… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
1996
1996
Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Experimental comparison of the running time of approximate string matching algorithms for the k differences problem is presented… Expand
  • figure 1
  • figure 4
  • figure 8
  • table I
  • figure 10
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The problem of finding all approximate occurrences P′ of a pattern string P in a text string T such that the edit distance… Expand
Is this relevant?