Bounds on Powers in Strings.
Maxime CrochemoreSzilárd Zsolt FazekasCostas S. IliopoulosInuka JayasekeraPublished in: Developments in Language Theory (2008)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- average case
- finite alphabet
- edit distance
- data sets
- finite state automata
- special case
- hamming distance
- distribution free
- finite automata
- string matching
- tight bounds
- biological sequences
- shortest common supersequence
- randomized algorithm
- database
- lower and upper bounds
- approximation algorithms
- error bounds
- pattern matching
- theoretical analysis
- worst case
- artificial intelligence
- genetic algorithm
- machine learning
- real time