Faster queries for longest substring palindrome after block edit
Palindromes are important objects in strings which have been extensively studied from
combinatorial, algorithmic, and bioinformatics points of views. Manacher [J. ACM 1975]
proposed a seminal algorithm that computes the longest substring palindromes (LSPals) of
a given string in O (n) time, where n is the length of the string. In this paper, we consider the
problem of finding the LSPal after the string is edited. We present an algorithm that uses O
(n) time and space for preprocessing, and answers the length of the LSPals in O (l+ log log …
combinatorial, algorithmic, and bioinformatics points of views. Manacher [J. ACM 1975]
proposed a seminal algorithm that computes the longest substring palindromes (LSPals) of
a given string in O (n) time, where n is the length of the string. In this paper, we consider the
problem of finding the LSPal after the string is edited. We present an algorithm that uses O
(n) time and space for preprocessing, and answers the length of the LSPals in O (l+ log log …
[CITATION][C] Faster Queries for Longest Substring Palindrome After Block Edit
中島祐人， 稲永俊介 - Proceedings of the 30th Annual Symposium on …, 2019 - cir.nii.ac.jp
Faster Queries for Longest Substring Palindrome After Block Edit | CiNii Research … Faster
Queries for Longest Substring Palindrome After Block Edit … タイトル Faster Queries for
Longest Substring Palindrome After Block Edit …
Queries for Longest Substring Palindrome After Block Edit … タイトル Faster Queries for
Longest Substring Palindrome After Block Edit …
Showing the best results for this search. See all results