Parameterized lower bound and inapproximability of polylogarithmic string barcoding.
Chunmei LiuYinglei SongLegand L. Burge IIIPublished in: J. Comb. Optim. (2008)
Keyphrases
- linear programming relaxation
- knapsack problem
- lower bound
- np hard
- approximation algorithms
- optimal solution
- string matching
- data structure
- pattern matching
- regular expressions
- upper bound
- edit distance
- suffix tree
- context free grammars
- search space
- lower bounding
- branch and bound algorithm
- hamming distance
- data sets
- special case
- objective function