Rotations of Periodic Strings and Short Superstrings
From MaRDI portal
Recommendations
Cited in
(25)- Unbordered partial words
- Why greed works for shortest common superstring problem
- A 2_3² superstring approximation algorithm
- Partial words and the critical factorization theorem
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem
- Partial words and the critical factorization theorem revisited
- A multidimensional critical factorization theorem
- A linear time algorithm for shortest cyclic cover of strings
- On the shortest common superstring of NGS reads
- Simple real-time constant-space string matching
- The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings
- Why Greed Works for Shortest Common Superstring Problem
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
- Simple real-time constant-space string matching
- A probabilistic PTAS for shortest common superstring
- Linear computation of unbordered conjugate on unordered alphabet
- Approximating shortest superstring problem using de Bruijn graphs
- Lyndon words and short superstrings
- Recurrence and periodicity in infinite words from local periods
- Approximation guarantees for shortest superstrings: simpler and better
- Border correlation of binary words
- Characteristic Sturmian words are extremal for the critical factorization theorem
- On the number of frames in binary words
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
- The greedy algorithm for shortest superstrings
This page was built for publication: Rotations of Periodic Strings and Short Superstrings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4360136)
