Faster Sublinear-Time Edit Distance

Bringmann, Karl; Cassis, Alejandro; Fischer, Nick; Kociumaka, Tomasz

doi:10.1137/1.9781611977912.117

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Faster Sublinear-Time Edit Distance

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons263580

Cassis, Alejandro
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons284929

Kociumaka, Tomasz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://epubs.siam.org/doi/10.1137/1.9781611977912.117
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., Cassis, A., Fischer, N., & Kociumaka, T. (2024). Faster Sublinear-Time Edit Distance. In D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 3274-3301). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977912.117.

Cite as: https://hdl.handle.net/21.11116/0000-0010-33A4-B

Abstract

There is no abstract available