The longest common subsequence problem for sequences with nested arc annotations. (Q1872715): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triangulating planar graphs under the four-connectivity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Approximation Schemes for Maximization Problems onK3,3-free orK5-free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Longest Common Subsequence Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near optimal multiple alignment within a band in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs in four pages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024817 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0022-0000(02)00004-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067194564 / rank
 
Normal rank

Latest revision as of 08:21, 30 July 2024

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