The Number of Distinct Subpalindromes in Random Words
From MaRDI portal
Publication:4976404
DOI10.3233/FI-2016-1366zbMath1385.68029arXiv1505.08043WikidataQ96718109 ScholiaQ96718109MaRDI QIDQ4976404
Arseny M. Shur, Mikhail Rubinchik
Publication date: 28 July 2017
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.08043
Related Items
EERTREE: an efficient data structure for processing palindromes in strings ⋮ Tight tradeoffs for real-time approximation of longest palindromes in streams ⋮ Upper bound for palindromic and factor complexity of rich words
