Does preprocessing help in fast sequence comparisons?

DOI10.1145/3357713.3384300OpenAlexW3035231910MaRDI QIDQ5144952

Elazar Goldenberg, Aviad Rubinstein, Barna Saha

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.09115

zbMATH Keywords

approximation algorithmsedit distancepreprocessing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Does preprocessing help in fast sequence comparisons?