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

From MaRDI portal
Revision as of 08:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    repetition-free longest common subsequence
    0 references
    decision diagram
    0 references
    maximum independent set
    0 references

    Identifiers