Superstrings with multiplicities
From MaRDI portal
Publication:5140785
DOI10.4230/LIPICS.CPM.2018.21zbMATH Open1497.68597OpenAlexW2803912975MaRDI QIDQ5140785FDOQ5140785
Authors: Bastien Cazaux, Eric Rivals 
Publication date: 16 December 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2018.21
Recommendations
Cites Work
- Greedy in Approximation Algorithms
- On-line construction of suffix trees
- On finding minimal length superstrings
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
- Reoptimization of the shortest common superstring problem
- Linear approximation of shortest superstrings
- Mathematical Foundations of Computer Science 2005
- A note on shortest superstrings with flipping
- The shortest superstring problem
- Algorithms for Three Versions of the Shortest Common Superstring Problem
- On the greedy algorithm for the shortest common superstring problem with reversals
- A linear time algorithm for shortest cyclic cover of strings
- Relationship between superstring and compression measures: new insights on the greedy conjecture
- Practical lower and upper bounds for the shortest linear superstring
Cited In (7)
- Superstrings. II
- A linear time algorithm for shortest cyclic cover of strings
- Collapsing Superstring Conjecture
- Superstrings with tensor degrees of freedom
- Practical lower and upper bounds for the shortest linear superstring
- More superstrings from supergravity
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent
This page was built for publication: Superstrings with multiplicities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140785)
