On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time (Q2384787): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-007-0063-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047375893 / rank | |||
Normal rank | |||
Latest revision as of 23:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time |
scientific article |
Statements
On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time (English)
0 references
10 October 2007
0 references
GG algorithm
0 references
Lcharacters
0 references
