Suffix array: Difference between revisions

Revision as of 23:50, 23 December 2021

Revision as of 23:50, 23 December 2021

Line 1:

{{Infobox

| above = Shreya Suffix array

| label1 = [[List of data structures|Type]]

| data1 = [[Array data structure|Array]]

Line 20:

}}

}}

In [[computer science]], a stuti '''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, full text indices, data compression algorithms, and 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}}.