Suffix tree

Known as: Position tree, Suffix trie, Suffixtree 
In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1976-2017
020406019762017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
This paper proposes a new algorithm, called Semantic Suffix Tree Clustering (SSTC), to cluster web search results containing… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The suffix tree is one of the most important data structures in string processing and comparative genomics. However, the space… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Large string datasets are common in a number of emerging text and biological database applications. Common queries over such… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. We present a recursive technique… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Linear-Time Construction of Suffix Trees We will present two methods for constructing suffix trees in detail, Ukkonen’s method… (More)
  • figure 5.1
  • figure 5.3
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We show that suffix trees store various kinds of redundant information. We exploit these redundancies to obtain more space… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • table III
Is this relevant?
Highly Cited
1995
Highly Cited
1995
An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string… (More)
  • figure 1
  • figure 2
Is this relevant?
1994
1994
An O(rn)-work 0(log4 rn)-time common CRCWPRAM algorithm for constructing the suffix tree of a string s of length m drawn from any… (More)
Is this relevant?
Highly Cited
1976
Highly Cited
1976
A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This… (More)
  • figure 2
  • figure 5
Is this relevant?