Approximating the geometric edit distance
From MaRDI portal
Recommendations
- Approximating the geometric edit distance
- Approximating edit distance in near-linear time
- Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier
- Approximating edit distance in near-linear time
- Approximating dynamic time warping and edit distance for a pair of point sequences
Cites work
- A faster algorithm computing string edit distances
- Algorithms for approximate string matching
- An improved approximation algorithm for the discrete Fréchet distance
- Approximability of the discrete Fréchet distance
- Approximating dynamic time warping and edit distance for a pair of point sequences
- Approximating the geometric edit distance
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
- Dynamic time warping and geometric edit distance: breaking the quadratic barrier
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Incremental String Comparison
- On the complexity of \(k\)-SAT
- Polylogarithmic approximation for edit distance and the asymmetric query complexity
- The String-to-String Correction Problem
Cited in
(4)
This page was built for publication: Approximating the geometric edit distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165024)
