Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.05.030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2015577249 / rank | |||
Normal rank | |||
Revision as of 23:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space |
scientific article |
Statements
Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (English)
0 references
18 October 2007
0 references
Compressed suffix array
0 references
FM-index
0 references
index data structure
0 references
Burrows-Wheeler transform
0 references
