Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Itzhaki, Michael"'
Autor:
Itzhaki, Michael
This paper introduces a novel method for compressing palindromic structures in strings, establishing upper and lower bounds for their efficient representation. We uncover a unique relationship between the Lempel-Ziv parsing of palindromes and the alp
Externí odkaz:
http://arxiv.org/abs/2410.09984
Autor:
Amir, Amihood, Itzhaki, Michael
The palindromic fingerprint of a string $S[1\ldots n]$ is the set $PF(S) = \{(i,j)~|~ S[i\ldots j] \textit{ is a maximal }\\ \textit{palindrome substring of } S\}$. In this work, we consider the problem of string reconstruction from a palindromic fin
Externí odkaz:
http://arxiv.org/abs/2406.04507
The recovery problem is the problem whose input is a corrupted text T that was originally periodic, and where one wishes to recover its original period. The algorithm’s input is T without any information about either the period’s length or the pe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b5d572d6a710298268321350f3ccf1e
Autor:
Leszek Gąsieniec
This book constitutes the conference proceedings of the 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, held in Nový Smokovec, Slovakia, during January 15–18, 2023.The 22 full papers present