Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123002641 / 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.dam.2017.04.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2615811680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear approximation of shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the greedy algorithm for the shortest common superstring problem with reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal length superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Superstring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Shortest Superstring Problem Using de Bruijn Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Conjecture for Strings of Length 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why greed works for shortest common superstring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon Words and Short 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: On the Greedy Superstring Conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 16:16, 15 July 2024

scientific article
Language Label Description Also known as
English
Relationship between superstring and compression measures: new insights on the greedy conjecture
scientific article

    Statements

    Relationship between superstring and compression measures: new insights on the greedy conjecture (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    approximation algorithm
    0 references
    shortest common superstring problem
    0 references
    stringology
    0 references
    data compression
    0 references
    assembly
    0 references
    greedy conjecture
    0 references

    Identifiers