Collapsing Superstring Conjecture
From MaRDI portal
Cites work
- A constant-factor approximation algorithm for the asymmetric traveling salesman problem
- A finite-difference sieve to count paths and cycles by length
- A greedy approximation algorithm for constructing shortest common superstrings
- A linear time algorithm for shortest cyclic cover of strings
- An Eulerian path approach to DNA fragment assembly
- Approximating shortest superstring problem using de Bruijn graphs
- Approximation algorithms for the shortest common superstring problem
- CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM
- Dynamic programming meets the principle of inclusion and exclusion
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Faster and simpler approximation of stable matchings
- Greedy Conjecture for Strings of Length 4
- Hierarchical overlap graph
- Linear approximation of shortest superstrings
- Lyndon words and short superstrings
- On finding minimal length superstrings
- P-Complete Approximation Problems
- Practical lower and upper bounds for the shortest linear superstring
- Relationship between superstring and compression measures: new insights on the greedy conjecture
- Solving SCS for bounded length strings in fewer than \(2^n\) steps
- Superstrings with multiplicities
- The greedy algorithm for shortest superstrings
- The shortest superstring problem
- The traveling-salesman problem and minimum spanning trees: Part II
Cited in
(2)
This page was built for publication: Collapsing Superstring Conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875478)
