Pages that link to "Item:Q3128987"
From MaRDI portal
The following pages link to Sequential and Parallel Approximation of Shortest Superstrings (Q3128987):
Displaying 10 items.
- Recognition of overlap graphs (Q405660) (← links)
- The greedy algorithm for shortest superstrings (Q834977) (← links)
- Testing string superprimitivity in parallel (Q1318749) (← links)
- Parallel constructions of maximal path sets and applications to short superstrings (Q1366535) (← links)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- NC algorithms for finding a maximal set of paths with application to compressing strings (Q4645170) (← links)
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853) (← links)
- Parallel and sequential approximation of shortest superstrings (Q5056169) (← links)
- Improved length bounds for the shortest superstring problem (Q5057460) (← links)
- Approximating shortest superstrings with constraints (Q5060130) (← links)