Computing Longest Single-arm-gapped Palindromes in a String - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara. Computing Longest Single-arm-gapped Palindromes in a String. In Bernhard Steffen, Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria, editors, SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings. Volume 10139 of Lecture Notes in Computer Science, pages 375-386, Springer, 2017. [doi]

The following publications are possibly variants of this publication:

Efficient computation of longest single-arm-gapped palindromes in a stringShintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara. TCS, 812:160-173, 2020. [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]

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]

runs on WebDSL