An almost optimal edit distance oracle

Panagiotis Charalampopoulos, Paweł Gawrychowski, Shay Mozes, Oren Weimann

نتاج البحث: فصل من :كتاب / تقرير / مؤتمرمنشور من مؤتمرمراجعة النظراء


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 score of S[i..j] and T[a..b]. Let N = mn. We present an oracle with preprocessing time N1+o(1) and space N1+o(1) that answers queries in log2+o(1) N time. In other words, we show that we can efficiently query for the alignment score of every pair of substrings after preprocessing the input for 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 O(N) has slow Ω(√ N) query time [Sakai, TCS 2019], and the one with size N1+o(1) and query time log2+o(1) N (using a planar graph distance oracle) has slow Ω(N3/2) construction time [Long & Pettie, SODA 2021]. We improve both approaches by roughly a √ N factor.

اللغة الأصليةإنجليزيّة أمريكيّة
عنوان منشور المضيف48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
المحررونNikhil Bansal, Emanuela Merelli, James Worrell
ناشرSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
رقم المعيار الدولي للكتب (الإلكتروني)9783959771955
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 1 يوليو 2021
الحدث48th International Colloquium on Automata, Languages, and Programming, ICALP 2021 - Virtual, Glasgow, بريطانيا
المدة: ١٢ يوليو ٢٠٢١١٦ يوليو ٢٠٢١

سلسلة المنشورات

الاسمLeibniz International Proceedings in Informatics, LIPIcs
مستوى الصوت198


!!Conference48th International Colloquium on Automata, Languages, and Programming, ICALP 2021
المدينةVirtual, Glasgow

All Science Journal Classification (ASJC) codes

  • !!Software


أدرس بدقة موضوعات البحث “An almost optimal edit distance oracle'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا