Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets.
Pawel GawrychowskiTomohiro IShunsuke InenagaDominik KöpplFlorin ManeaPublished in: Theory Comput. Syst. (2018)
Keyphrases
- worst case
- upper bound
- lower bound
- error bounds
- average case
- worst case analysis
- space complexity
- finding optimal
- lower and upper bounds
- np hard
- optimization problems
- tight bounds
- greedy algorithm
- computational complexity
- optimal solution
- theoretical guarantees
- approximation algorithms
- loss bounds
- vc dimension
- running times
- minimum distance
- worst case bounds
- suffix array
- biological sequences
- upper and lower bounds
- times faster
- computationally efficient
- evolutionary algorithm
- data structure