Palindromic length in linear time
From MaRDI portal
Publication:5110889
DOI10.4230/LIPICS.CPM.2017.23zbMath1434.68724OpenAlexW2753173575MaRDI QIDQ5110889
Arseny M. Shur, Mikhail Rubinchik, Dmitry Kosolobov, Kirill Borozdin
Publication date: 25 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.CPM.2017.23
Related Items (13)
Prefix palindromic length of the Thue-Morse word ⋮ Factorizing strings into repetitions ⋮ Palindromic length and reduction of powers ⋮ EERTREE: an efficient data structure for processing palindromes in strings ⋮ An efficient algorithm for the longest common palindromic subsequence problem ⋮ Dynamic and internal longest common substring ⋮ On highly palindromic words: the \(n\)-ary case ⋮ On prefix palindromic length of automatic words ⋮ Diverse Palindromic Factorization is NP-Complete ⋮ Unnamed Item ⋮ On the size of overlapping Lempel-Ziv and Lyndon factorizations ⋮ Comparing Degenerate Strings ⋮ On highly palindromic words: the ternary case
This page was built for publication: Palindromic length in linear time
