Pages that link to "Item:Q5057460"
From MaRDI portal
The following pages link to Improved length bounds for the shortest superstring problem (Q5057460):
Displaying 10 items.
- Shortest consistent superstrings computable in polynomial time (Q673640) (← links)
- The greedy algorithm for shortest superstrings (Q834977) (← links)
- A note on shortest superstrings with flipping (Q1208439) (← links)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- Rotations of Periodic Strings and Short Superstrings (Q4360136) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853) (← links)