Albert Weichselbraun

is a Professor of Information Science at the University of Applied of the Grisons.

40 years of suffix trees

less than 1 minute read

Suffix trees are used in text searching, indexing, statistics. This article describes the history, construction, current developments and applications of suffix trees.

Of special interest are applications that use suffix tries in conjunction with the Burrows-Wheeler transformation for compression and structures such as the succinct suffix tree and the suffix array that aim at reducing the space requirements of the tree.

You may also enjoy

Suffix array

1 minute read

The suffix array is a memory-efficient alternative to the suffix tree which provides a sorted list of string indices indicating the string’s suffixes.