Pages that link to "Item:Q1281759"
From MaRDI portal
The following pages link to A \(2_3^2\) superstring approximation algorithm (Q1281759):
Displaying 11 items.
- Approximating shortest superstrings with constraints (Q1341729) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← 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)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model (Q3652303) (← links)
- Linear approximation of shortest superstrings (Q4310837) (← links)
- Rotations of Periodic Strings and Short Superstrings (Q4360136) (← links)
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853) (← links)
- Improved length bounds for the shortest superstring problem (Q5057460) (← links)
- Superstrings with multiplicities (Q5140785) (← links)