Weighted edit distance computation: strings, trees, and Dyck
From MaRDI portal
Publication:6499236
Cites work
- scientific article; zbMATH DE number 5872386 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1305084 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- A Minimum Distance Error-Correcting Parser for Context-Free Languages
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- A graph distance metric based on the maximal common subgraph
- A sublinear algorithm for weakly approximating edit distance
- A survey on tree edit distance and related problems
- Algorithms for approximate string matching
- Algorithms on Strings, Trees and Sequences
- An \(O(ND)\) difference algorithm and its variations
- An optimal decomposition algorithm for tree edit distance
- Approximately matching context-free languages
- Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time
- Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
- Approximating edit distance in near-linear time
- Combinatorial Pattern Matching
- Compressing and indexing labeled trees, with applications
- Constant factor approximations to edit distance on far input pairs in nearly linear time
- Constant-factor approximation of near-linear edit distance in near-linear time
- Does preprocessing help in fast sequence comparisons?
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Fast Algorithms for Finding Nearest Common Ancestors
- Fast string matching with k differences
- If the current clique algorithms are optimal, so is Valiant's parser
- Improved bounds for rectangular monotone min-plus product and applications
- Incremental String Comparison
- Internal pattern matching queries in a text and applications
- Near-linear time insertion-deletion codes and \((1+\varepsilon)\)-approximating edit distance via indexing
- Near-optimal quantum algorithms for string problems
- On the sorting-complexity of suffix tree construction
- Polylogarithmic approximation for edit distance and the asymmetric query complexity
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- The String-to-String Correction Problem
- The Tree-to-Tree Correction Problem
- The ``runs theorem
- The tree-to-tree editing problem
- Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- Uniqueness Theorems for Periodic Functions
- \(1+\varepsilon\) approximation of tree edit distance in quadratic time
This page was built for publication: Weighted edit distance computation: strings, trees, and Dyck
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499236)
