Efficient algorithms to compute compressed longest common substrings and compressed palindromes (Q1006070)
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: Efficient algorithms to compute compressed longest common substrings and compressed palindromes |
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
