LCS approximation via embedding into locally non-repetitive strings.
Gad M. LandauAvivit LevyIlan NewmanPublished in: Inf. Comput. (2011)
Keyphrases
- longest common subsequence
- shortest common supersequence
- approximation algorithms
- closed form
- approximation error
- learning classifier systems
- similarity function
- error bounds
- dynamic time warping
- watermarking algorithm
- data sets
- queueing networks
- vector space
- finite automata
- graph embedding
- repetitive patterns
- machine learning methods
- approximation schemes
- finite alphabet
- evolutionary algorithm