An Almost Optimal Edit Distance Oracle

We consider the problem of preprocessing two strings S and T, of lengths m and n, respectively, in order to be able to efficiently answer the following queries: Given positions i,j in S and positions a,b in T, return the optimal alignment of S[i . . j] and T[a . . b]. Let N=mn. We present an oracle with preprocessing time N^1+o(1) and space N^1+o(1) that answers queries in log^2+o(1)N time. In other words, we show that we can query the alignment of every two substrings in almost the same time it takes to compute just the alignment of S and T. Our oracle uses ideas from our distance oracle for planar graphs [STOC 2019] and exploits the special structure of the alignment graph. Conditioned on popular hardness conjectures, this result is optimal up to subpolynomial factors. Our results apply to both edit distance and longest common subsequence (LCS). The best previously known oracle with construction time and size 𝒪(N) has slow Ω(√(N)) query time [Sakai, TCS 2019], and the one with size N^1+o(1) and query time log^2+o(1)N (using a planar graph distance oracle) has slow Ω(N^3/2) construction time [Long Pettie, SODA 2021]. We improve both approaches by roughly a √(N) factor.

READ FULL TEXT

page 1

page 3

page 7

page 8

page 11

page 13

page 17

page 19

research
08/20/2021

Does Preprocessing help in Fast Sequence Comparisons?

We study edit distance computation with preprocessing: the preprocessing...
research
11/05/2018

Almost Optimal Distance Oracles for Planar Graphs

We present new tradeoffs between space and query-time for exact distance...
research
07/16/2020

Planar Distance Oracles with Better Time-Space Tradeoffs

In a recent breakthrough, Charalampopoulos, Gawrychowski, Mozes, and Wei...
research
05/05/2021

Tree Path Minimum Query Oracle via Boruvka Trees

Tree path minimum query problem is a fundamental problem while processin...
research
10/11/2022

A Note on Reachability and Distance Oracles for Transmission Graphs

Let P be a set of n points in the plane, where each point p∈ P has a tra...
research
11/05/2022

Map matching queries on realistic input graphs under the Fréchet distance

Map matching is a common preprocessing step for analysing vehicle trajec...
research
07/12/2022

Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency

Thorup [FOCS'01, JACM'04] and Klein [SODA'01] independently showed that ...

Please sign up or login with your details

Forgot password? Click here to reset