About: Suffix array

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Suffix array Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

In computer science, a suffix array is a sorted array of all suffixes of a 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 as a simple, space efficient alternative to suffix trees. They had independently been discovered by Gaston Gonnet in 1987 under the name PAT array.

Attributes	Values
rdfs:label	Suffix array (en)
rdfs:comment	In computer science, a suffix array is a sorted array of all suffixes of a 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 as a simple, space efficient alternative to suffix trees. They had independently been discovered by Gaston Gonnet in 1987 under the name PAT array. (en)
sameAs	Suffix array Suffix array
dbp:wikiPageUsesTemplate	dbt:Citation_needed dbt:Cite_conference dbt:Cite_journal dbt:Commons_category dbt:Harv dbt:Harvtxt dbt:Infobox dbt:Reflist dbt:Sfn dbt:Aligned_table dbt:Strings
Subject	Arrays Computer science suffixes String data structures Substring indices
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Suffix_array?oldid=1071919073&ns=0
Wikipage page ID	1303494 (xsd:integer)
page length (characters) of wiki page	29891 (xsd:nonNegativeInteger)
Wikipage revision ID	1071919073 (xsd:integer)
has abstract	In computer science, a suffix array is a sorted array of all suffixes of a 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 as a simple, space efficient alternative to suffix trees. They had independently been discovered by Gaston Gonnet in 1987 under the name PAT array. gave the first in-place time suffix array construction algorithm that is optimal both in time and space, where in-place means that the algorithm only needs additional space beyond the input string and the output suffix array. Enhanced suffix arrays (ESAs) are suffix arrays with additional tables that reproduce the full functionality of suffix trees preserving the same time and memory complexity.The suffix array for a subset of all suffixes of a string is called . Multiple probabilistic algorithms have been developed to minimize the additional memory usage including an optimal time and memory algorithm. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Suffix_array
is Wikipage redirect of	Suffix Array Enhanced suffix array
is Link from a Wikipage to another Wikipage of	List of terms relating to algorithms and data structures Bowtie (sequence analysis) Burrows–Wheeler transform Generalized suffix array Generalized suffix tree Delta encoding List of data structures Compressed data structure Compressed suffix array ESA (disambiguation) Enhanced suffix array Gaston Gonnet FM-index LCP array Eugene Myers Maximal pair Multi-key quicksort Factor oracle

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software