Repetition-free longest common subsequence (Q5901069)

From MaRDI portal
Revision as of 01:49, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article; zbMATH DE number 5770506
Language Label Description Also known as
English
Repetition-free longest common subsequence
scientific article; zbMATH DE number 5770506

    Statements

    Repetition-free longest common subsequence (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 August 2010
    0 references
    longest common subsequence
    0 references
    APX-hardness
    0 references
    approximation algorithms
    0 references

    Identifiers