Restricted Common Superstring and Restricted Common Supersequence (Q3011876): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q287448
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Moshe Lewenstein / 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.1007/978-3-642-21458-5_39 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1547982388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation of shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs / 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: The shortest common nonsubsequence problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Alignment, Communication Cost, and Graph Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest common supersequence problem over binary alphabet is NP- complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Noninclusion Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank

Latest revision as of 06:26, 4 July 2024

scientific article
Language Label Description Also known as
English
Restricted Common Superstring and Restricted Common Supersequence
scientific article

    Statements

    Restricted Common Superstring and Restricted Common Supersequence (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references