Computing longest palindromic substring after single-character or block-wise edits

M Funakoshi, Y Nakashima, S Inenaga… - Theoretical Computer …, 2021 - Elsevier
Palindromes are important objects in strings which have been extensively studied from
combinatorial, algorithmic, and bioinformatics points of views. It is known that the length of …
被引用次数：12 相关文章

[引用][C] Computing longest palindromic substring after single-character or block-wise edits

M Funakoshi, Y Nakashima, S Inenaga… - Theoretical Computer …, 2021 - cir.nii.ac.jp
Computing longest palindromic substring after single-character or block-wise edits | CiNii
Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ …

Computing longest palindromic substring after single-character or block-wise edits

M Funakoshi, Y Nakashima, S Inenaga… - arXiv preprint arXiv …, 2019 - arxiv.org
Palindromes are important objects in strings which have been extensively studied from
combinatorial, algorithmic, and bioinformatics points of views. It is known that the length of …

Computing longest palindromic substring after single-character or block-wise edits

M Funakoshi, Y Nakashima, S Inenaga… - arXiv e …, 2019 - ui.adsabs.harvard.edu
Palindromes are important objects in strings which have been extensively studied from
combinatorial, algorithmic, and bioinformatics points of views. It is known that the length of …

Computing longest palindromic substring after single-character or block-wise edits

M Funakoshi, Y Nakashima… - Theoretical …, 2021 - kyushu-u.elsevierpure.com
Palindromes are important objects in strings which have been extensively studied from
combinatorial, algorithmic, and bioinformatics points of views. It is known that the length of …