On the use of decision diagrams for finding repetition-free longest common subsequences (Q2679779)

From MaRDI portal
Revision as of 19:39, 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
On the use of decision diagrams for finding repetition-free longest common subsequences
scientific article

    Statements

    On the use of decision diagrams for finding repetition-free longest common subsequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 January 2023
    0 references
    0 references
    repetition-free longest common subsequence
    0 references
    decision diagram
    0 references
    maximum independent set
    0 references
    0 references