The longest common subsequence problem for arc-annotated sequences (Q876717): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Guo-Hui Lin / rank
Normal rank
 
Property / author
 
Property / author: Zhang, Kaizhong / rank
Normal rank
 
Property / author
 
Property / author: Guo-Hui Lin / rank
 
Normal rank
Property / author
 
Property / author: Zhang, Kaizhong / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation properties of the Independent set problem for degree 3 graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case for subset interconnection designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024816 / 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: The longest common subsequence problem for sequences with nested arc annotations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / 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: Q3024817 / rank
 
Normal rank

Latest revision as of 17:18, 25 June 2024

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