Jump to content

Generalized suffix array

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BryanRamos0199 (talk | contribs) at 17:54, 11 May 2021. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, a generalized suffix array is a suffix array containing all suffixes for a set of strings. Given the set of strings of total length , it is a lexicographically sorted array of all suffixes of each string in .

References

Shi F. (1996) Suffix arrays for multiple strings: A method for on-line multiple string searches. In: Jaffar J., Yap R.H.C. (eds) Concurrency and Parallelism, Programming, Networking, and Security. ASIAN 1996. Lecture Notes in Computer Science, vol 1179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027775