Skip to search formSkip to main contentSkip to account menu

Suffix tree

Known as: Position tree, Suffixtree, Suffix (disambiguation) 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They… 
2008
2008
Suffix trees are among the most important data structures in stringology, with myriads of applications. Their main problem is… 
2004
2004
Currently, foliage biomass is estimated based on stem diameter or basal area. However, it is questionable whether the relations… 
2004
2004
Suffix trees have been the focus of significant research interest as they permit very efficient solutions to a range of string… 
2003
2003
String matching is critical in information retrieval since in many cases information is stored and manipulated as strings… 
2003
2003
The EMILLE Project (Enabling Minority Language Engineering) was established to construct a 67 million word corpus of South Asian… 
2002
2002
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments… 
2002
2002
Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word w , we… 
Highly Cited
1996
Highly Cited
1996
Abstract. We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural… 
1980
1980
This paper presents an on-line algorithm for the construction of position trees, i.e., an algorithm which constructs the position…