Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,107,667 papers from all fields of science
Search
Sign In
Create Free Account
Suffix tree
Known as:
Position tree
, Suffixtree
, Suffix (disambiguation)
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Algorithmica
Alignment-free sequence analysis
Analysis of parallel algorithms
Approximate string matching
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Parallel and Distributed Compressed Indexes
L. Russo
,
G. Navarro
,
Arlindo L. Oliveira
Annual Symposium on Combinatorial Pattern…
2010
Corpus ID: 2901510
We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They…
Expand
2008
2008
An(other) Entropy-Bounded Compressed Suffix Tree
J. Fischer
,
V. Mäkinen
,
G. Navarro
Annual Symposium on Combinatorial Pattern…
2008
Corpus ID: 16531736
Suffix trees are among the most important data structures in stringology, with myriads of applications. Their main problem is…
Expand
2004
2004
Competition-dependent modelling of foliage biomass in forest stands
Rüdiger Grote
,
I. Reiter
Trees
2004
Corpus ID: 23948514
Currently, foliage biomass is estimated based on stem diameter or basal area. However, it is questionable whether the relations…
Expand
2004
2004
Constructing chromosome scale suffix trees
Dr A. L. Brown
2004
Corpus ID: 10818475
Suffix trees have been the focus of significant research interest as they permit very efficient solutions to a range of string…
Expand
2003
2003
Bidirectional Construction of Suffix Trees
Shunsuke Inenaga
Nordic Journal of Computing
2003
Corpus ID: 2512956
String matching is critical in information retrieval since in many cases information is stored and manipulated as strings…
Expand
2003
2003
Corpus data for South Asian language processing.
Paul Baker
,
A. Hardie
,
Tony McEnery
,
B. Jayaram
2003
Corpus ID: 28685739
The EMILLE Project (Enabling Minority Language Engineering) was established to construct a 67 million word corpus of South Asian…
Expand
2002
2002
Suffix Vector: Space- and Time-Efficient Alternative to Suffix Trees
K. Monostori
,
A. Zaslavsky
,
H. Schmidt
Australasian Computer Science Conference
2002
Corpus ID: 7987771
Suffix trees are versatile data structures that are used for solving many string-matching problems. One of the main arguments…
Expand
2002
2002
Words over an ordered alphabet and suffix permutations
Jean-Pierre Duval
,
A. Lefebvre
RAIRO - Theoretical Informatics and Applications
2002
Corpus ID: 32035913
Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word w , we…
Expand
Highly Cited
1996
Highly Cited
1996
Suffix Trees on Words
A. Andersson
,
N. Jesper Larsson
,
Kurt W. Swanson
Algorithmica
1996
Corpus ID: 2675272
Abstract. We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural…
Expand
1980
1980
Efficient On-Line Construction and Correction of Position Trees
M. Majster
1980
Corpus ID: 195718072
This paper presents an on-line algorithm for the construction of position trees, i.e., an algorithm which constructs the position…
Expand
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)
ACCEPT & CONTINUE