Rotations of Periodic Strings and Short Superstrings
From MaRDI portal
Publication:4360136
DOI10.1006/jagm.1997.0861zbMath0883.68046MaRDI QIDQ4360136
Tao Jiang, Dany Breslauer, Zhigen Jiang
Publication date: 20 October 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/96da12d457f45ba6e575e6026b28c06ac85394cf
68P10: Searching and sorting
Related Items
Approximating Shortest Superstring Problem Using de Bruijn Graphs, Recurrence and periodicity in infinite words from local periods, The power of greedy algorithms for approximating Max-ATSP, cyclic cover, and superstrings, 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, 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, Unbordered partial words, Why greed works for shortest common superstring problem, A \(2_3^2\) 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, Why Greed Works for Shortest Common Superstring Problem
