The greedy algorithm for edit distance with moves.
Haim KaplanNira ShafrirPublished in: Inf. Process. Lett. (2006)
Keyphrases
- greedy algorithm
- edit distance
- dynamic programming
- string matching
- greedy algorithms
- similarity measure
- graph matching
- levenshtein distance
- edit operations
- distance measure
- objective function
- worst case
- approximate string matching
- graph edit distance
- distance function
- string edit distance
- influence maximization
- string similarity
- influence spread
- tree edit distance
- tree structured data
- approximate matching
- randomized algorithm
- lower bound
- greedy strategy
- finite alphabet
- scheduling problem
- pattern recognition
- normalized edit distance