Pages that link to "Item:Q1034529"
From MaRDI portal
The following pages link to Repetitions in strings: algorithms and combinatorics (Q1034529):
Displaying 36 items.
- Square-free words with one possible mismatch (Q297663) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Extracting powers and periods in a word from its runs structure (Q389938) (← links)
- Versatile string kernels (Q391141) (← links)
- On the maximal sum of exponents of runs in a string (Q450542) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- New simple efficient algorithms computing powers and runs in strings (Q496538) (← links)
- Average number of occurrences of repetitions in a necklace (Q496552) (← links)
- The ``runs'' conjecture (Q544875) (← links)
- Algorithms for anti-powers in strings (Q1641162) (← links)
- Computing primitively-rooted squares and runs in partial words (Q1678102) (← links)
- Efficient algorithms for shortest partial seeds in words (Q1698721) (← links)
- Partial words with a unique position starting a square (Q1730024) (← links)
- The maximal number of cubic runs in a word (Q1757839) (← links)
- Existence of words over three-letter alphabet not containing squares with replacement errors (Q1791616) (← links)
- Efficient counting of square substrings in a tree (Q2250458) (← links)
- Generating all minimal Petri net unsolvable binary words (Q2295623) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- DNA combinatorial messages and epigenomics: the case of chromatin organization and nucleosome occupancy in eukaryotic genomes (Q2326390) (← links)
- Existence of words over a binary alphabet free from squares with mismatches (Q2332806) (← links)
- Squares and primitivity in partial words (Q2341712) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- Double string tandem repeats (Q2700385) (← links)
- The marble frieze patterns of the cathedral of Siena: geometric structure, multi-stable perception and types of repetition (Q2920299) (← links)
- Computing Primitively-Rooted Squares and Runs in Partial Words (Q2946044) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- Towards a Solution to the “Runs” Conjecture (Q3506961) (← links)
- (Q5009559) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Abelian Repetitions in Sturmian Words (Q5300843) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- Nonrepetitive and pattern-free colorings of the plane (Q5964253) (← links)
- Two-dimensional Fibonacci words: tandem repeats and factor complexity (Q6107832) (← links)
- Online algorithms on antipowers and antiperiods (Q6536254) (← links)
- Exact and inexact search for 2d side-sharing tandems (Q6658301) (← links)
