A work-time optimal algorithm for computing all string covers (Q671438)

From MaRDI portal
Revision as of 01:24, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
A work-time optimal algorithm for computing all string covers
scientific article

    Statements

    A work-time optimal algorithm for computing all string covers (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    0 references
    repetitive structures of strings
    0 references
    0 references