Pages that link to "Item:Q450542"
From MaRDI portal
The following pages link to On the maximal sum of exponents of runs in a string (Q450542):
Displaying 14 items.
- The total run length of a word (Q391314) (← links)
- On palindromic factorization of words (Q394756) (← links)
- Average number of occurrences of repetitions in a necklace (Q496552) (← links)
- On the distribution of runs of ones in binary strings (Q979847) (← links)
- Searching of gapped repeats and subrepetitions in a word (Q1679608) (← links)
- On the number of gapped repeats with arbitrary gap (Q1708025) (← links)
- Optimal bounds for computing \({\alpha}\)-gapped repeats (Q2272989) (← links)
- Some results on the number of periodic factors in words (Q2288207) (← links)
- Two strings at Hamming distance 1 cannot be both quasiperiodic (Q2404618) (← links)
- On the Maximal Sum of Exponents of Runsin a String (Q3000489) (← links)
- (Q3565863) (← links)
- NUMBER OF OCCURRENCES OF POWERS IN STRINGS (Q3586403) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- The Number of Runs in a String: Improved Analysis of the Linear Upper Bound (Q5449797) (← links)