{"paper":{"title":"Near-Linear Time Insertion-Deletion Codes and (1+$\\varepsilon$)-Approximating Edit Distance via Indexing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Amirbehshad Shahrasbi, Aviad Rubinstein, Bernhard Haeupler","submitted_at":"2018-10-28T19:21:33Z","abstract_excerpt":"We introduce fast-decodable indexing schemes for edit distance which can be used to speed up edit distance computations to near-linear time if one of the strings is indexed by an indexing string $I$. In particular, for every length $n$ and every $\\varepsilon >0$, one can in near linear time construct a string $I \\in \\Sigma'^n$ with $|\\Sigma'| = O_{\\varepsilon}(1)$, such that, indexing any string $S \\in \\Sigma^n$, symbol-by-symbol, with $I$ results in a string $S' \\in \\Sigma''^n$ where $\\Sigma'' = \\Sigma \\times \\Sigma'$ for which edit distance computations are easy, i.e., one can compute a $(1+"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.11863","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}