Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings (Q2032287)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithms for the shortest unique palindromic substring problem on run-length encoded strings |
scientific article |
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
