English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

An Algorithmic Bridge Between Hamming and Levenshtein Distances

MPS-Authors
/persons/resource/persons284929

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

External Resource

https://drops.dagstuhl.de/opus/volltexte/2023/17561/
(Publisher version)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

LIPIcs-ITCS-2023-58.pdf
(Publisher version), 991KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Goldenberg, E., Kociumaka, T., Krauthgamer, R., & Saha, B. (2023). An Algorithmic Bridge Between Hamming and Levenshtein Distances. In Y. Tauman Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference (pp. 1-23). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ITCS.2023.58.


Cite as: https://hdl.handle.net/21.11116/0000-000C-1588-3
Abstract
There is no abstract available