Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287)
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 7357723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings |
scientific article; zbMATH DE number 7357723 |
Statements
Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (English)
0 references
11 June 2021
0 references
string algorithms
0 references
run-length encoding
0 references
palindromes
0 references
shortest unique substrings
0 references
0 references
0 references
0 references
0.9603269
0 references
0.9230096
0 references
0.9224538
0 references
0 references
0 references
0.9035699
0 references
0.8849814
0 references
0.88189536
0 references
