Arrow Research search
Back to STOC

STOC 2020

Does preprocessing help in fast sequence comparisons?

Conference Paper Session 6A: Strings and Sequences Algorithms and Complexity ยท Theoretical Computer Science

Abstract

We study edit distance computation with preprocessing: the preprocessing algorithm acts on each string separately, and then the query algorithm takes as input the two preprocessed strings. This model is inspired by scenarios where we would like to compute edit distance between many pairs in the same pool of strings.

Authors

Keywords

  • preprocessing
  • edit distance
  • approximation algorithms

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
643792153709598429
v2026.09.13