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 the given text...

output suffix array. Enhanced suffix arrays (ESAs) are suffix arrays with additional tables that reproduce the full functionality of suffix trees preserving...

In computer science, a generalized suffix tree is a suffix tree for a set of strings. Given the set of strings D = S 1 , S 2 , … , S d {\displaystyle D=S_{1}...

Augmenting the suffix array with the LCP array allows one to efficiently simulate top-down and bottom-up traversals of the suffix tree, speeds up pattern...

with a generalized suffix tree. The longest common substrings of a set of strings can be found by building a generalized suffix tree for the strings, and...

Suffix Tree Clustering, often abbreviated as STC is an approach for clustering that uses suffix trees. A suffix tree cluster keeps track of all n-grams...

algorithm for constructing suffix trees, proposed by Esko Ukkonen in 1995. The algorithm begins with an implicit suffix tree containing the first character...

that Weiner's 1973 suffix-tree construction algorithm while building a suffix tree of the string S {\displaystyle S} constructs a suffix automaton of the...

nodes that contain links, which either point to other suffix child nodes or null. As for every tree, each node but the root is pointed to by only one other...

each tree node compares a bit slice of key values. Radix tree Suffix tree Suffix array Compressed suffix array FM-index Generalised suffix tree B-tree Judy...

index notation Suffix array, an array of integers giving the starting positions of suffixes of a string in lexicographical order Suffix tree, a data structure...

binary tree where each leaf (end node) holds a string of manageable size and length (also known as a weight), and each node further up the tree holds the...

index, for example a suffix tree or suffix array, the occurrences of a pattern can be found quickly. As an example, a suffix tree can be built in Θ ( n...

Raimar; Frenzel, Pierre (2006). "Clone Detection Using Abstract Syntax Suffix Trees". 2006 13th Working Conference on Reverse Engineering. IEEE. pp. 253–262...

banana: banana |||| nana A suffix tree for a string is a trie data structure that represents all of its suffixes. Suffix trees have large numbers of applications...

include: The suffix tree, a radix tree of the suffixes of the string, allowing substring search to be performed symbol-by-symbol The suffix automaton, the...

has no left or right children. This would represent a unique suffix in the ternary tree corresponding to the key string. If there is no such path, this...

generalized suffix array can be generated for a generalized suffix tree. When compared to a generalized suffix tree, while the generalized suffix array will...

{\displaystyle O(n\,{\log |\Sigma |})} bits. The conventional suffix array and suffix tree use Ω ( n log ⁡ n ) {\displaystyle \Omega (n\,{\log n})} bits...

structured into a tree. A media type can optionally define a suffix and parameters: mime-type = type "/" [tree "."] subtype ["+" suffix]* [";" parameter];...

Substring index Suffix array Suffix automaton Suffix tree Compressed suffix array LCP array FM-index Generalized suffix tree Rope Ternary search tree Trie Other...

building a suffix tree for the string (with a special end-of-string symbol like '$' appended), and finding the deepest internal node in the tree with more...

whose names include a -gate suffix, by analogy with the Watergate scandal, as well as other incidents to which the suffix has (often facetiously) been...

a compact notation for regular grammars Regular tree grammar, a generalization from strings to trees Prefix grammar Chomsky hierarchy Hidden Markov model...

subsequence subset substring subtree succinct data structure suffix suffix array suffix automaton suffix tree superimposed code superset supersink supersource symmetric...

| Tree (Black, Tree (Red, a, x, Tree (Red, b, y, c)), z, d) | Tree (Black, a, x, Tree (Red, Tree (Red, b, y, c), z, d)) | Tree (Black, a, x, Tree (Red...

represent a substantial space improvement over the conventional suffix tree and suffix array, which occupy many times more space than the size of T. They...

A street suffix is the part of a street or road name that describes what type of road it is. Examples include "street", "avenue", "lane", "highway", and...

Guy E. (2014), "A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction", ACM Transactions on Parallel Computing...

(Singapore) Generation-skipping transfer tax, in the United States Generalized suffix tree GeSbTe, a phase-change material GST Computer Systems, a group of British...