Repetitions in strings: algorithms and combinatorics
From MaRDI portal
(Redirected from Publication:1034529)
Recommendations
Cites work
- A characterization of the squares in a Fibonacci string
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- Algorithms on Strings
- Algorithms on Strings, Trees and Sequences
- AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
- An O(n log n) algorithm for finding all repetitions in a string
- An optimal algorithm for computing the repetitions in a word
- Analysis of Maximal Repetitions in Strings
- Bounds on Powers in Strings
- Computing longest previous factor in linear time and applications
- Computing regularities in strings: a survey
- Crochemore Factorization of Sturmian and Other Infinite Words
- Detecting leftmost maximal periodicities
- Fast and Practical Algorithms for Computing All the Runs in a String
- How many runs can a string contain?
- How many squares can a string contain?
- scientific article; zbMATH DE number 3723890 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 2105037 (Why is no real title available?)
- scientific article; zbMATH DE number 756768 (Why is no real title available?)
- Jewels of Stringology
- Linear time algorithms for finding and representing all the tandem repeats in a string
- Maximal repetitions in strings
- Not So Many Runs in Strings
- Optimal off-line detection of repetitions in a string
- Repetitions in Sturmian strings
- Repetitions in the Fibonacci infinite word
- Repetitive perhaps, but certainly not boring
- Squares, cubes, and time-space efficient string searching
- The exact number of squares in Fibonacci words
- The Lempel–Ziv Complexity of Fixed Points of Morphisms
- The number of runs in a string
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
- The Number of Runs in Sturmian Words
- The structure of subword graphs and suffix trees of Fibonacci words
- Time-space-optimal string matching
- Towards a Solution to the “Runs” Conjecture
- Transducers and repetitions
- Two-way string-matching
Cited in
(46)- Repetitive perhaps, but certainly not boring
- Algorithms for anti-powers in strings
- Computing primitively-rooted squares and runs in partial words
- Efficient algorithms for shortest partial seeds in words
- Partial words with a unique position starting a square
- The maximal number of cubic runs in a word
- Existence of words over three-letter alphabet not containing squares with replacement errors
- A combinatorial view on string attractors
- Efficient counting of square substrings in a tree
- Generating all minimal Petri net unsolvable binary words
- Two-dimensional maximal repetitions
- DNA combinatorial messages and epigenomics: the case of chromatin organization and nucleosome occupancy in eukaryotic genomes
- Existence of words over a binary alphabet free from squares with mismatches
- Squares and primitivity in partial words
- Prefix frequency of lost positions
- Detecting regularities on grammar-compressed strings
- Computing equality-free and repetitive string factorisations
- Double string tandem repeats
- The marble frieze patterns of the cathedral of Siena: geometric structure, multi-stable perception and types of repetition
- Computing primitively-rooted squares and runs in partial words
- Large-scale detection of repetitions
- Square-free words with one possible mismatch
- On the Maximal Sum of Exponents of Runsin a String
- Maximum number of distinct and nonequivalent nonstandard squares in a word
- scientific article; zbMATH DE number 3864532 (Why is no real title available?)
- Towards a Solution to the “Runs” Conjecture
- Extracting powers and periods in a word from its runs structure
- Versatile string kernels
- On the maximal sum of exponents of runs in a string
- Fast algorithm for partial covers in words
- New simple efficient algorithms computing powers and runs in strings
- Average number of occurrences of repetitions in a necklace
- Two-dimensional maximal repetitions
- Constructing words with high distinct square densities
- Are three squares impossible?
- Hunting redundancies in strings
- Abelian repetitions in Sturmian words
- The ``runs theorem
- The ``runs conjecture
- Nonrepetitive and pattern-free colorings of the plane
- Two-dimensional Fibonacci words: tandem repeats and factor complexity
- Online algorithms on antipowers and antiperiods
- Exact and inexact search for 2d side-sharing tandems
- Linear time runs over general ordered alphabets
- On primary and secondary repetitions in words
- Clusters of repetition roots: single chains
This page was built for publication: Repetitions in strings: algorithms and combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034529)
