The following publications are possibly variants of this publication:
- Dynamic and Internal Longest Common SubstringAmihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski. algorithmica, 82(12):3707-3743, 2020. [doi]
- Dynamic Longest Common Substring in Polylogarithmic TimePanagiotis Charalampopoulos, Pawel Gawrychowski, Karol Pokorski. icalp 2020: [doi]
- Faster Algorithms for Longest Common SubstringPanagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski. esa 2021: [doi]
- 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]