On the Maximal Independent Sets of k-mers with the Edit Distance.
Leran MaKe ChenMingfu ShaoPublished in: CoRR (2023)
Keyphrases
- edit distance
- graph matching
- string matching
- edit operations
- levenshtein distance
- distance function
- similarity measure
- string similarity
- distance measure
- graph edit distance
- approximate string matching
- string edit distance
- approximate matching
- longest common subsequence
- tree edit distance
- dissimilarity measure
- normalized edit distance
- tree structured data
- dynamic programming
- finite alphabet
- similarity join