Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings.
Julian Pape-LangePublished in: Int. J. Found. Comput. Sci. (2023)
Keyphrases
- upper bound
- lower bound
- minimum distance
- worst case
- tight bounds
- upper and lower bounds
- branch and bound
- branch and bound algorithm
- sample size
- edit distance
- error probability
- generalization error
- closely related
- concept classes
- approximate string matching
- sample complexity
- markov random field
- average case
- string matching
- compressive sensing
- learning algorithm
- machine learning
- neural network