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)

Related topics

Related topics

50 relations
AlgorithmicaAlignment-free sequence analysisAnalysis of parallel algorithmsApproximate string matching

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Ultra-succinct representation of ordered trees with applications
2008
2008
An(other) Entropy-Bounded Compressed Suffix Tree
Suffix trees are among the most important data structures in stringology, with myriads of applications. Their main problem is… 
2006
2006
Topic Detection and Tracking for News Web Pages
This paper proposes a new approach to observe, summarize and track events from a collection of news Web pages. Given a set of… 
2004
2004
Competition-dependent modelling of foliage biomass in forest stands
Currently, foliage biomass is estimated based on stem diameter or basal area. However, it is questionable whether the relations… 
2004
2004
Constructing chromosome scale suffix trees
Suffix trees have been the focus of significant research interest as they permit very efficient solutions to a range of string… 
2003
2003
Bidirectional Construction of Suffix Trees
String matching is critical in information retrieval since in many cases information is stored and manipulated as strings… 
2003
2003
Corpus data for South Asian language processing.
The EMILLE Project (Enabling Minority Language Engineering) was established to construct a 67 million word corpus of South Asian… 
2002
2002
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments… 
Highly Cited
1996
Highly Cited
1996
Suffix Trees on Words
Abstract. We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural… 
Highly Cited
1995
Highly Cited
1995
Suffix Cactus: A Cross between Suffix Tree and Suffix Array
The suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and… 
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)