Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved length bounds for the shortest superstring problem / 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: An algorithm for the Rural Postman problem on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Three Versions of the Shortest Common Superstring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel and sequential approximation of shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc Routing Problems, Part II: The Rural Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding minimal length superstrings / 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 greedy algorithm for shortest superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lyndon Words and Short Superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Eulerian path approach to DNA fragment assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-Complete Approximation Problems / 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: A greedy approximation algorithm for constructing shortest common superstrings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296972 / 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: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank

Latest revision as of 12:40, 6 July 2024

scientific article; zbMATH DE number 6176329
Language Label Description Also known as
English
Approximating Shortest Superstring Problem Using de Bruijn Graphs
scientific article; zbMATH DE number 6176329

    Statements

    Approximating Shortest Superstring Problem Using de Bruijn Graphs (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2013
    0 references

    Identifiers