Suffix array: Difference between revisions

Revision as of 18:36, 11 May 2020

Revision as of 12:38, 20 May 2020

Line 23:

|}

In [[computer science]], a '''suffix array''' is a sorted [[Array data structure|array]] of all [[Suffix (computer science)|suffixes]] of a [[String (computer science)|string]]. It is a data structure used in, among others, in full text indices, data compression algorithms, and within the field of [[bibliometrics]].

Suffix arrays were introduced by {{harvtxt|Manber|Myers|1990}} as a simple, space efficient alternative to [[suffix tree]]s. They had independently been discovered by [[Gaston Gonnet]] in 1987 under the name ''PAT array'' {{harv|Gonnet|Baeza-Yates|Snider|1992}}.