Approximability of constrained LCS (Q439929): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q940168
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ming-Hui Jiang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.10.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001332692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ALGORITHMS FOR THE CONSTRAINED LONGEST COMMON SUBSEQUENCE PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of constrained longest common subsequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized constrained longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for the constrained sequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained LCS: Hardness and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New efficient algorithms for the LCS and constrained LCS problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal, maximal, and consistent sequences over a binary alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined super-/substring and super-/subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained longest common subsequence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 14:21, 5 July 2024

scientific article
Language Label Description Also known as
English
Approximability of constrained LCS
scientific article

    Statements

    Approximability of constrained LCS (English)
    0 references
    17 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    longest common subsequence
    0 references
    computational biology
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references
    0 references
    0 references