A suffix tree is a data structure that stores all suffixes of a string. It is the basis for many fast algorithms on strings.
Questions tagged [suffix-tree]
228 questions
-2
votes
1 answer
what does this line do in this code?
i have found following code on online for suffix tree
#include
#define E 0
struct suffix_tree_node;
struct suffix_tree_link {
// 0 is e - global index of during string's end
unsigned long start;
unsigned long end;
…
user466534
-3
votes
1 answer
suffix tree implementation issue
I am studying some Suffix tree implementation and here is one reference implementation, and question is how "indexes" (refer line 19) is used for class SuffixTreeNode? I am not sure if "indexes" is useful and I think probably we just need to keep…
Lin Ma
- 9,739
- 32
- 105
- 175
-5
votes
1 answer
How many different substrings are in a string?
I need to design an algorithm in O (n) that given a string t of length n, calculate the number of different substrings of t.
corxil
- 3
- 1