A \(2_3^2\) superstring approximation algorithm
From MaRDI portal
Publication:1281759
DOI10.1016/S0166-218X(98)00065-1zbMath0936.68027MaRDI QIDQ1281759
Publication date: 25 May 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (1)
Cites Work
- On finding minimal length superstrings
- An efficient algorithm for the all pairs suffix-prefix problem
- Approximating shortest superstrings with constraints
- Approximation algorithms for the shortest common superstring problem
- Combinatorial algorithms for DNA sequence assembly
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- Linear approximation of shortest superstrings
- Rotations of Periodic Strings and Short Superstrings
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
- Parallel and sequential approximation of shortest superstrings
- Improved length bounds for the shortest superstring problem
- Uniqueness Theorems for Periodic Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A \(2_3^2\) superstring approximation algorithm
