Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings.
Danny HuckeCarl Philipp RehPublished in: Algorithms (2021)
Keyphrases
- shortest common supersequence
- pairwise
- dynamic programming
- error bounds
- closed form
- edit distance
- greedy algorithm
- databases
- feature selection
- machine learning
- approximation ratio
- string matching
- bayesian networks
- search algorithm
- data sets
- learning algorithm
- approximation algorithms
- computational complexity
- queueing networks
- np hard
- relative error
- greedy heuristic
- evolutionary algorithm
- preventive maintenance
- damage assessment