Longest common subsequence problem for unoriented and cyclic strings (Q868937): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:27, 5 March 2024

scientific article
Language Label Description Also known as
English
Longest common subsequence problem for unoriented and cyclic strings
scientific article

    Statements

    Longest common subsequence problem for unoriented and cyclic strings (English)
    0 references
    0 references
    0 references
    26 February 2007
    0 references
    longest common subsequence
    0 references
    LCS
    0 references
    cyclic string
    0 references
    sequence comparison
    0 references
    pattern recognition
    0 references
    graph
    0 references
    hypergraph
    0 references
    maximum stable set
    0 references
    maximum independent set
    0 references
    approximation
    0 references
    parameterized complexity
    0 references
    NP-hard
    0 references
    W[1]-hard
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references