Near-optimal computation of runs over general alphabet via non-crossing LCE queries (Q1796824)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Near-optimal computation of runs over general alphabet via non-crossing LCE queries |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Near-optimal computation of runs over general alphabet via non-crossing LCE queries |
scientific article |
Statements
Near-optimal computation of runs over general alphabet via non-crossing LCE queries (English)
0 references
17 October 2018
0 references
0.8466786
0 references
0.8436536
0 references
0.83098674
0 references
0.8257388
0 references
0 references
0.82097334
0 references
