New Lower Bounds for the Maximum Number of Runs in a String.
Wataru MatsubaraKazuhiko KusanoAkira IshinoHideo BannaiAyumi ShinoharaPublished in: Stringology (2008)
Keyphrases
- maximum number
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- string matching
- np hard
- data structure
- objective function
- edit distance
- regular expressions
- lower and upper bounds
- vc dimension
- uc berkeley
- randomly generated problems
- pattern matching
- optimal solution
- worst case
- context free grammars
- lower bounding
- data sets
- hamming distance
- sample complexity
- suffix tree
- online learning
- linear programming relaxation
- concept class
- databases