Approximability of constrained LCS (Q439929): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
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

Revision as of 01:50, 30 June 2023

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

    Statements

    Approximability of constrained LCS (English)
    0 references
    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