A 2_3² superstring approximation algorithm
From MaRDI portal
A \(2 3^2\) superstring approximation algorithm
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 828444 (Why is no real title available?)
- 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
- Improved length bounds for the shortest superstring problem
- Linear approximation of shortest superstrings
- On finding minimal length superstrings
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- Parallel and sequential approximation of shortest superstrings
- Rotations of Periodic Strings and Short Superstrings
- Uniqueness Theorems for Periodic Functions
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
Cited in
(16)- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
- Improved length bounds for the shortest superstring problem
- Practical lower and upper bounds for the shortest linear superstring
- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
- Lyndon words and short superstrings
- Approximating shortest superstring problem using de Bruijn graphs
- scientific article; zbMATH DE number 1759460 (Why is no real title available?)
- Superstrings with multiplicities
- On the shortest common superstring of NGS reads
- Solving 3-superstring in \(3^{n/3}\) time
- Approximating shortest superstrings with constraints
- The shortest common superstring problem: average case analysis for both exact and approximate matching
- Linear approximation of shortest superstrings
- Mathematical Foundations of Computer Science 2005
- Relationship between superstring and compression measures: new insights on the greedy conjecture
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
This page was built for publication: A \(2_3^2\) superstring approximation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281759)
