Sequential and Parallel Approximation of Shortest Superstrings
From MaRDI portal
Recommendations
- Parallel and sequential approximation of shortest superstrings
- \boldmath A 2\frac12-Approximation Algorithm for Shortest Superstring
- Approximating shortest superstrings with constraints
- Approximating Shortest Superstrings
- Approximating shortest superstrings with constraints
- Linear approximation of shortest superstrings
- A linear-time algorithm for finding approximate shortest common superstrings
- Practical lower and upper bounds for the shortest linear superstring
- Approximating shortest superstring problem using de Bruijn graphs
Cited in
(12)- NC algorithms for finding a maximal set of paths with application to compressing strings
- Parallel and sequential approximation of shortest superstrings
- \boldmath A 2\frac12-Approximation Algorithm for Shortest Superstring
- Approximation guarantees for shortest superstrings: simpler and better
- Mathematical Foundations of Computer Science 2005
- Testing string superprimitivity in parallel
- Approximating shortest superstrings with constraints
- Recognition of overlap graphs
- On the shortest common superstring of NGS reads
- Fast RNC and NC algorithms for finding a maximal set of paths with an application
- The greedy algorithm for shortest superstrings
- Improved length bounds for the shortest superstring problem
This page was built for publication: Sequential and Parallel Approximation of Shortest Superstrings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128987)
