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 the normal view instead:
scientific article; zbMATH DE number 5529516
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms to compute compressed longest common substrings and compressed palindromes |
scientific article; zbMATH DE number 5529516 |
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
0.9801543951034546
0 references
0.8300246000289917
0 references
0.8256974220275879
0 references
0.8046610355377197
0 references
0.7938272953033447
0 references
