Pages that link to "Item:Q5056169"
From MaRDI portal
The following pages link to Parallel and sequential approximation of shortest superstrings (Q5056169):
Displaying 9 items.
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- Fast RNC and NC algorithms for maximal path sets (Q1285573) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Parallel constructions of maximal path sets and applications to short superstrings (Q1366535) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- Sequential and Parallel Approximation of Shortest Superstrings (Q3128987) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853) (← links)
- Improved length bounds for the shortest superstring problem (Q5057460) (← links)