Repetitive perhaps, but certainly not boring
From MaRDI portal
Publication:1583539
DOI10.1016/S0304-3975(00)00067-0zbMath0949.68125MaRDI QIDQ1583539
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences, The number of runs in a string, Can we recover the cover?, On the structure of run-maximal strings, String Covering: A Survey, The “Runs” Theorem, Experimental evaluation of algorithms for computing quasiperiods, Computing regularities in strings: a survey, A Linear-Time Algorithm for Seeds Computation, Repetitions in strings: algorithms and combinatorics, Approximate cover of strings, Quasi-Periodicity Under Mismatch Errors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient detection of quasiperiodicities in strings
- Optimal superprimitivity testing for strings
- Avoidable patterns in strings of symbols
- Strongly non-repetitive sequences and progression-free sets
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- An on-line string superprimitivity test
- The exact number of squares in Fibonacci words
- An optimal algorithm to compute all the covers of a string
- Some combinatorial properties of Sturmian words
- A characterization of the squares in a Fibonacci string
- On cube-free \(\omega\)-words generated by binary morphisms
- Covering a string
- The subtree max gap problem with application to parallel string covering
- On the computational power of pushdown automata
- An O(n log n) algorithm for finding all repetitions in a string
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Algorithms on Strings, Trees and Sequences
- Open Problems in Pattern Avoidance
- Descriptions of the Characteristic Sequence of an Irrational
- Abelian squares are avoidable on 4 letters
- Uniqueness Theorems for Periodic Functions
- Simple and flexible detection of contiguous repeats using a suffix tree
