Repetitive perhaps, but certainly not boring
From MaRDI portal
Publication:1583539
DOI10.1016/S0304-3975(00)00067-0zbMATH Open0949.68125MaRDI QIDQ1583539FDOQ1583539
Authors: W. F. Smyth 
Publication date: 26 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Algorithms on Strings, Trees and Sequences
- Avoidable patterns in strings of symbols
- On the computational power of pushdown automata
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- Some combinatorial properties of Sturmian words
- An O(n log n) algorithm for finding all repetitions in a string
- Open Problems in Pattern Avoidance
- Simple and flexible detection of contiguous repeats using a suffix tree
- Strongly non-repetitive sequences and progression-free sets
- An on-line string superprimitivity test
- An optimal algorithm to compute all the covers of a string
- Title not available (Why is that?)
- Descriptions of the Characteristic Sequence of an Irrational
- Abelian squares are avoidable on 4 letters
- Title not available (Why is that?)
- Optimal superprimitivity testing for strings
- On cube-free \(\omega\)-words generated by binary morphisms
- Covering a string
- The subtree max gap problem with application to parallel string covering
- Efficient detection of quasiperiodicities in strings
- Title not available (Why is that?)
- A characterization of the squares in a Fibonacci string
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Beatty Sequences, Continued Fractions, and Certain Shift Operators
- Title not available (Why is that?)
- Title not available (Why is that?)
- The exact number of squares in Fibonacci words
- Title not available (Why is that?)
Cited In (14)
- Are three squares impossible?
- Strongly qth Power–Free Strings
- String Covering: A Survey
- Quasi-periodicity under mismatch errors
- Approximate cover of strings
- Can we recover the cover?
- Title not available (Why is that?)
- Computing regularities in strings: a survey
- On the structure of run-maximal strings
- Repetitions in strings: algorithms and combinatorics
- Experimental evaluation of algorithms for computing quasiperiods
- A Heuristic For Computing Repeats With A Factor Oracle: Application To Biological Sequences
- The ``runs theorem
- The number of runs in a string
This page was built for publication: Repetitive perhaps, but certainly not boring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583539)
