Faster Pattern Matching under Edit Distance: A Reduction to Dynamic Puzzle 
Matching and the Seaweed Monoid of Permutation Matrices

Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Wellnitz, Philip

doi:10.1109/FOCS54457.2022.00072

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Faster Pattern Matching under Edit Distance: A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices

MPS-Authors

/persons/resource/persons284929

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

/persons/resource/persons229250

Wellnitz, Philip
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

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

Charalampopoulos, P., Kociumaka, T., & Wellnitz, P. (2022). Faster Pattern Matching under Edit Distance: A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices. In FOCS 2022 (pp. 698-707). Piscataway, NJ: IEEE. doi:10.1109/FOCS54457.2022.00072.

Cite as: https://hdl.handle.net/21.11116/0000-000C-1571-D

Abstract

There is no abstract available