Near-linear time edit distance for indel channels
From MaRDI portal
Publication:6487652
Recommendations
Cites work
- scientific article; zbMATH DE number 5764889 (Why is no real title available?)
- A faster algorithm computing string edit distances
- A sublinear algorithm for weakly approximating edit distance
- Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
- Approximating edit distance in near-linear time
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Efficiently approximating edit distance between pseudorandom strings
- Global alignment of molecular sequences via ancestral state reconstruction
- Incremental String Comparison
- Oblivious string embeddings and edit distance approximations
- Optimal sequence length requirements for phylogenetic tree reconstruction with indels
- Polylogarithmic approximation for edit distance and the asymmetric query complexity
- Trace reconstruction with \(\exp(O(n^{1/3}))\) samples
Cited in
(4)
This page was built for publication: Near-linear time edit distance for indel channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487652)
