New Lower Bounds for the Maximum Number of Runs in a String
Kazuhiko KusanoWataru MatsubaraAkira IshinoHideo BannaiAyumi ShinoharaPublished in: CoRR (2008)
Keyphrases
- maximum number
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- string matching
- pattern matching
- lower and upper bounds
- np hard
- objective function
- optimal solution
- edit distance
- regular expressions
- lower bounding
- upper and lower bounds
- worst case
- quadratic assignment problem
- binary strings
- linear programming relaxation
- data structure
- optimal cost
- randomly generated problems
- uc berkeley
- main memory
- linear programming
- concept class
- string similarity