The constrained shortest common supersequence problem (Q396654): 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: 68W32 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6329900 / rank
 
Normal rank
Property / zbMATH Keywords
 
shortest common supersequence
Property / zbMATH Keywords: shortest common supersequence / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter algorithms
Property / zbMATH Keywords: fixed-parameter algorithms / rank
 
Normal rank

Revision as of 16:26, 29 June 2023

scientific article
Language Label Description Also known as
English
The constrained shortest common supersequence problem
scientific article

    Statements

    The constrained shortest common supersequence problem (English)
    0 references
    0 references
    13 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest common supersequence
    0 references
    approximation algorithms
    0 references
    computational complexity
    0 references
    fixed-parameter algorithms
    0 references