Linear approximation of shortest superstrings
From MaRDI portal
Recommendations
Cited in
(61)- Sharpening Occam's razor
- Minimum-weight cycle covers and their approximability
- Why greed works for shortest common superstring problem
- A note on shortest superstrings with flipping
- A 2_3² superstring approximation algorithm
- Faster implementation of a shortest superstring approximation
- Approximating shortest superstrings with constraints
- Inferring a tree from walks
- Greedy algorithms for the shortest common superstring that are asymptotically optimal
- Relationship between superstring and compression measures: new insights on the greedy conjecture
- Combinatorial algorithms for DNA sequence assembly
- Physical mapping of chromosomes: A combinatorial problem in molecular biology
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent
- Hierarchical overlap graph
- A combinatorial approach to the design of vaccines
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- An external-memory algorithm for string graph construction
- Optimal solutions in the multi-location inventory system with transshipments
- From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
- The approximability of the weighted Hamiltonian path completion problem on a tree
- A linear time algorithm for shortest cyclic cover of strings
- Solving 3-superstring in \(3^{n/3}\) time
- On the shortest common superstring of NGS reads
- Restricted common superstring and restricted common supersequence
- Two approaches to the common superstring problem
- Sequential and Parallel Approximation of Shortest Superstrings
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
- A Probabilistic PTAS for Shortest Common Superstring
- On the Greedy Superstring Conjecture
- Why Greed Works for Shortest Common Superstring Problem
- Minimum-Weight Cycle Covers and Their Approximability
- Analysis of heuristics.
- A probabilistic PTAS for shortest common superstring
- Recognition of overlap graphs
- scientific article; zbMATH DE number 1263192 (Why is no real title available?)
- Approximating Shortest Superstrings
- On the approximation of shortest common supersequences and longest common subsequences
- scientific article; zbMATH DE number 3999290 (Why is no real title available?)
- Approximating shortest superstring problem using de Bruijn graphs
- Restricted and swap common superstring: a multivariate algorithmic perspective
- scientific article; zbMATH DE number 7364999 (Why is no real title available?)
- Parallel and sequential approximation of shortest superstrings
- Improved length bounds for the shortest superstring problem
- Approximating shortest superstrings with constraints
- On the approximability of the maximum common subgraph problem
- Practical lower and upper bounds for the shortest linear superstring
- Superstrings with multiplicities
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Fast prefix matching of bounded strings
- CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM
- Collapsing Superstring Conjecture
- Combined super-/substring and super-/subsequence problems
- String editing under pattern constraints
- Minimized compact automaton for clumps over degenerate patterns
- Constructions of covering sequences and 2D-sequences
- Approximation guarantees for shortest superstrings: simpler and better
- On the decoding error weight of one or two deletion channels
- Diagram processing: Computing with diagrams
- The greedy algorithm for shortest superstrings
- On the greedy algorithm for the shortest common superstring problem with reversals
- A linear-time algorithm for finding approximate shortest common superstrings
This page was built for publication: Linear approximation of shortest superstrings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4310837)
