The following publications are possibly variants of this publication:
- Faster Queries for Longest Substring Palindrome After Block EditMitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. cpm 2019: [doi]
- Computing longest palindromic substring after single-character or block-wise editsMitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. TCS, 859:116-133, 2021. [doi]
- Longest Lyndon Substring After EditYuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. cpm 2018: [doi]
- Computing Longest Common Substring and All Palindromes from Compressed StringsWataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto. sofsem 2008: 364-375 [doi]
- Efficient algorithms to compute compressed longest common substrings and compressed palindromesWataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto. TCS, 410(8-10):900-913, 2009. [doi]
- Minimal Unique Palindromic Substrings After Single-Character SubstitutionMitsuru Funakoshi, Takuya Mieno. spire 2021: 33-46 [doi]