The longest common subsequence problem for arc-annotated sequences (Q876717)

From MaRDI portal
Revision as of 17:18, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The longest common subsequence problem for arc-annotated sequences
scientific article

    Statements

    The longest common subsequence problem for arc-annotated sequences (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2007
    0 references
    RNA structural similarity comparison
    0 references
    sequence annotation
    0 references
    longest common subsequence
    0 references
    maximum independent set
    0 references
    Max SNP-hard
    0 references
    approximation algorithm
    0 references
    dynamic programming
    0 references

    Identifiers