Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:52, 5 March 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
