The following publications are possibly variants of this publication:
- Longest Common Substring with Approximately k MismatchesTomasz Kociumaka, Jakub Radoszewski, Tatiana A. Starikovskaya. algorithmica, 81(6):2633-2652, 2019. [doi]
- Correction to: Longest Common Substring with Approximately k MismatchesTomasz Kociumaka, Jakub Radoszewski, Tatiana A. Starikovskaya. algorithmica, 81(7):3074, 2019. [doi]
- Approximating Longest Common Substring with k mismatches: Theory and PracticeGarance Gourdel, Tomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya. cpm 2020: [doi]
- Publisher Correction: Longest Common Substring with Approximately k MismatchesTomasz Kociumaka, Jakub Radoszewski, Tatiana Starikovskaya. algorithmica, 85(10):3323, October 2023. [doi]
- Computing the longest common substring with one mismatchMaxim A. Babenko, Tatiana A. Starikovskaya. poit, 47(1):28-33, 2011. [doi]