Content deleted Content added
Eliminate duplicate cite. Mores SFNs. |
|||
Line 33:
== Definition ==
Let <math>S=S[1]S[2]...S[n]</math> be an <math display="inline">n</math>-string and let <math>S[i,j]</math> denote the substring of <math>S</math> ranging from <math>i</math> to <math>j</math> inclusive.
The suffix array <math>A</math> of <math>S</math> is now defined to be an array of integers providing the starting positions of [[Suffix (computer science)|suffixes]] of <math>S</math> in [[lexicographical order]]. This means, an entry <math>A[i]</math> contains the starting position of the <math>i</math>-th smallest suffix in <math>S</math> and thus for all <math>1 < i \leq n</math>: <math>S[A[i-1],n] < S[A[i],n]</math>.
| |||