Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding.
Debarati DasTomasz KociumakaBarna SahaPublished in: ICALP (2022)
Keyphrases
- approximation algorithms
- edit distance
- rna secondary structures
- rna secondary structure prediction
- longest common subsequence
- np hard
- edit operations
- special case
- minimum cost
- graph matching
- worst case
- string matching
- distance measure
- vertex cover
- similarity measure
- approximate string matching
- graph edit distance
- levenshtein distance
- string similarity
- approximation ratio
- tree edit distance
- dynamic time warping
- approximate matching
- distance function
- string edit distance
- dynamic programming
- finite alphabet
- undirected graph
- minimal cost
- convex hull
- high dimensional
- pattern recognition
- search algorithm