Pages that link to "Item:Q389938"
From MaRDI portal
The following pages link to Extracting powers and periods in a word from its runs structure (Q389938):
Displaying 30 items.
- Computing minimal and maximal suffixes of a substring (Q294952) (← links)
- Closed factorization (Q313756) (← links)
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- Fast algorithm for partial covers in words (Q493243) (← links)
- Efficiently computing runs on a trie (Q820550) (← links)
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings (Q832954) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- Internal dictionary matching (Q2037109) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- Lower bounds for the number of repetitions in 2D strings (Q2146138) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- Longest previous overlapping factor array (Q2656356) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Computing runs on a trie (Q5088914) (← links)
- Quasi-Linear-Time Algorithm for Longest Common Circular Factor (Q5088916) (← links)
- Detecting One-Variable Patterns (Q5150937) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- (Q5874500) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)
- Shortest covers of all cyclic shifts of a string (Q5925516) (← links)
- Efficient enumeration of non-equivalent squares in partial words with few holes (Q5971176) (← links)
- The square density of words having a sequence of FS-double squares (Q6069178) (← links)
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)
