Greedy Conjecture for Strings of Length 4.
Alexander S. KulikovSergey SavinovEvgeniy SluzhaevPublished in: CPM (2015)
Keyphrases
- finite alphabet
- greedy algorithm
- feature selection
- alphabet size
- edit distance
- search algorithm
- greedy heuristic
- neural network
- computational complexity
- special case
- dynamic programming
- greedy algorithms
- normalized edit distance
- databases
- edit operations
- total length
- longest common subsequence
- minimum length
- locally optimal
- string matching
- search space
- information systems