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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2010
Review
2010
Temporal data has always captured people's imagination. Large databases of temporal data contain temporal patterns that can lead… 
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… 
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… 
2005
2005
2003
2003
Review
2001
Review
2001
In this paper we present a short survey and experimental results for well known sequential string matching algorithms. We… 
Highly Cited
2000
Highly Cited
2000
The most important features of a string matching algorithm are its efficiency and its flexibility. Efficiency has traditionally… 
1996
1996
Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are… 
Highly Cited
1996
Highly Cited
1996
Experimental comparison of the running time of approximate string matching algorithms for the k differences problem is presented… 
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…