The longest common subsequence problem for sequences with nested arc annotations. (Q1872715)

From MaRDI portal
Revision as of 08:21, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The longest common subsequence problem for sequences with nested arc annotations.
scientific article

    Statements

    The longest common subsequence problem for sequences with nested arc annotations. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 May 2003
    0 references
    Sequence annotation
    0 references
    Longest common subsequence
    0 references
    Book embedding
    0 references
    NP-hardness
    0 references
    Approximation algorithm
    0 references
    Polynomial-time approximation scheme
    0 references

    Identifiers

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