On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time (Q2384787)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5199508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time |
scientific article; zbMATH DE number 5199508 |
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
0.9960744976997375
0 references
0.9099223017692566
0 references
0.9039838910102844
0 references
0.903375208377838
0 references
