11 citations · 22 across the 4 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015
EERTREE: An Efficient Data Structure for Processing Palindromes in Strings
Mikhail Rubinchik, Arseny M. Shur
We propose a new linear-size data structure which provides a fast access to all palindromic substrings of a string or a set of strings. This structure inherits some ideas from the…
math.CO2015★ 9 cited
The Number of Distinct Subpalindromes in Random Words
Mikhail Rubinchik, Arseny M. Shur
We prove that a random word of length over a -ary fixed alphabet contains, on expectation, distinct palindromic factors. We study this number of factors, $E(n,…