Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666)
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: Algorithms and combinatorial properties on shortest unique palindromic substrings |
scientific article; zbMATH DE number 7003353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and combinatorial properties on shortest unique palindromic substrings |
scientific article; zbMATH DE number 7003353 |
Statements
Algorithms and combinatorial properties on shortest unique palindromic substrings (English)
0 references
18 January 2019
0 references
string algorithm
0 references
shortest unique substring (SUS)
0 references
palindrome
0 references
rich word
0 references
0 references
0.956604301929474
0 references
0.8943724036216736
0 references
0.8694750070571899
0 references
0.7824452519416809
0 references
0.7734613418579102
0 references
