research
∙
02/08/2023
Weighted Edit Distance Computation: Strings, Trees and Dyck
Given two strings of length n over alphabet Σ, and an upper bound k on t...
share
research
∙
09/15/2022
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance
Computing the edit distance of two strings is one of the most basic prob...
research
∙
05/29/2022
Generalized Stochastic Matching
In this paper, we generalize the recently studied Stochastic Matching pr...
research
∙
07/14/2020
