Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:54, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms to compute compressed longest common substrings and compressed palindromes |
scientific article |
Statements
Efficient algorithms to compute compressed longest common substrings and compressed palindromes (English)
0 references
17 March 2009
0 references
text compression
0 references
string processing algorithms
0 references
longest common substring
0 references
palindromes
0 references
straight line program
0 references
