Exact algorithms for the bounded repetition longest common subsequence problem (Q2180128)

From MaRDI portal
Revision as of 09:43, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Exact algorithms for the bounded repetition longest common subsequence problem
scientific article

    Statements

    Exact algorithms for the bounded repetition longest common subsequence problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 May 2020
    0 references
    0 references