Approximability of constrained LCS (Q439929): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Ming-Hui Jiang / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6067698 / rank
 
Normal rank
Property / zbMATH Keywords
 
longest common subsequence
Property / zbMATH Keywords: longest common subsequence / rank
 
Normal rank
Property / zbMATH Keywords
 
computational biology
Property / zbMATH Keywords: computational biology / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

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

    Identifiers

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