Correction to: ``Longest common substring with approximately \(k\) mismatches
From MaRDI portal
Publication:2415358
DOI10.1007/S00453-019-00560-1zbMath1412.68312OpenAlexW2923108274MaRDI QIDQ2415358
Tatiana Starikovskaya, Tomasz Kociumaka, Jakub Radoszewski
Publication date: 21 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-019-00560-1
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Algorithms on strings (68W32)
This page was built for publication: Correction to: ``Longest common substring with approximately \(k\) mismatches