Approximating Longest Common Substring with k mismatches: Theory and Practice

Garance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya. Approximating Longest Common Substring with k mismatches: Theory and Practice. In Inge Li Gørtz, Oren Weimann, editors, 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark. Volume 161 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Abstract

Abstract is missing.