Substring - Suffix

Suffix

A suffix of a string is a string, where . A proper suffix of a string is not equal to the string itself ; again, a more restricted interpretation is that it is also not empty . A suffix can be seen as a special case of a substring.

Example: The string nana is equal to a suffix (and substring and subsequence) of the string banana:

A suffix tree for a string is a trie data structure that represents all of its suffixes. Suffix trees have large numbers of applications in string algorithms. The suffix array is a simplified version of this data structure that lists the start positions of the suffixes in alphabetically sorted order; it has many of the same applications.