Approximating Longest Common Substring with k mismatches: Theory and Practice

DOI10.4230/LIPICS.CPM.2020.16MaRDI QIDQ5874444zbMATH OpenOpenAlexFDO

Authors Garance Gourdel, Tomasz Kociumaka, Tatiana Starikovskaya, Jakub Radoszewski

Publication date 7 February 2023

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

zbMATH Keywords

approximation algorithmsconditional lower boundsLSHstring similarity

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(1)

• Near-optimal quantum algorithms for string problems

This page was built for publication: Approximating Longest Common Substring with k mismatches: Theory and Practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874444)