Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings.
Julian Pape-LangePublished in: DLT (2021)
Keyphrases
- upper bound
- lower bound
- suffix array
- minimum distance
- upper and lower bounds
- lower and upper bounds
- sample size
- data structure
- closely related
- worst case
- tight upper and lower bounds
- tight bounds
- edit distance
- branch and bound
- hamming distance
- concept classes
- finite automata
- branch and bound algorithm
- repeating patterns
- efficiently computable
- finite alphabet
- sample complexity
- vc dimension
- generalization error
- string matching
- data compression