Near-Linear Time Insertion-Deletion Codes and (1+ε)-Approximating Edit Distance via Indexing.
Bernhard HaeuplerAviad RubinsteinAmirbehshad ShahrasbiPublished in: CoRR (2018)
Keyphrases
- edit distance
- string matching
- distance computation
- graph matching
- similarity measure
- distance measure
- edit operations
- approximate string matching
- suffix array
- string edit distance
- distance function
- tree structured data
- levenshtein distance
- hamming distance
- string similarity
- tree edit distance
- approximate matching
- subgraph isomorphism
- dynamic programming
- worst case
- pattern matching
- information retrieval
- indexing method
- finite alphabet
- pattern recognition
- graph edit distance