Computing Longest Common Substring and All Palindromes from Compressed Strings (Q5448662)

From MaRDI portal
Revision as of 13:34, 27 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5246008
Language Label Description Also known as
English
Computing Longest Common Substring and All Palindromes from Compressed Strings
scientific article; zbMATH DE number 5246008

    Statements

    Computing Longest Common Substring and All Palindromes from Compressed Strings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2008
    0 references
    0 references
    0 references
    0 references
    0 references