Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (Q3401100)

From MaRDI portal
Revision as of 20:01, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
scientific article

    Statements

    Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    longest previous reverse factor
    0 references
    longest previous non-overlapping factor
    0 references
    longest previous factor
    0 references
    palindrome
    0 references
    runs
    0 references
    suffix array
    0 references
    text compression
    0 references
    0 references