A note on a simple computation of the maximal suffix of a string (Q396649)
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: A note on a simple computation of the maximal suffix of a string |
scientific article; zbMATH DE number 6329897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on a simple computation of the maximal suffix of a string |
scientific article; zbMATH DE number 6329897 |
Statements
A note on a simple computation of the maximal suffix of a string (English)
0 references
13 August 2014
0 references
algorithm
0 references
constant space
0 references
linear time
0 references
maximal suffix
0 references
0.7884104251861572
0 references
0.7607026696205139
0 references
0.7602611184120178
0 references
0.7599433660507202
0 references
