Why Greed Works for Shortest Common Superstring Problem (Q3506957): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation of shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotations of Periodic Strings and Short Superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for the shortest common superstring that are asymptotically optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal length superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy approximation algorithm for constructing shortest common superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the shortest common superstring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Reconstructing Protein and RNA Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothed analysis of algorithms / 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: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest common superstring problem: average case analysis for both exact and approximate matching / rank
 
Normal rank

Latest revision as of 12:11, 28 June 2024

scientific article
Language Label Description Also known as
English
Why Greed Works for Shortest Common Superstring Problem
scientific article

    Statements

    Why Greed Works for Shortest Common Superstring Problem (English)
    0 references
    0 references
    17 June 2008
    0 references
    0 references
    0 references