We introduce a new family of string processing problems. Given two or more strings, we are asked to compute a factor common to all strings that preserves a specific property and has maximal length. We consider three fundamental string properties: square-free factors, periodic factors, and palindromic factors under three different settings, one per property. In the first setting, we are given a string x and we are asked to construct a data structure over x answering the following type of online queries: given a string y, find a longest square-free factor common to x and y. In the second setting, we are given k strings and an integer and we are asked to find a longest periodic factor common to at least strings. In the third one, we are given two strings and we are asked to find a longest palindromic factor common to the two strings. We present linear-time solutions for all settings.

Ayad, L., Bernardini, G., Grossi, R., Iliopoulos, C., Pisanti, N., Pissis, S., et al. (2020). Longest property-preserved common factor: A new string-processing framework. THEORETICAL COMPUTER SCIENCE, 812, 244-251 [10.1016/j.tcs.2020.02.012].

Longest property-preserved common factor: A new string-processing framework

Bernardini G.
;
2020

Abstract

We introduce a new family of string processing problems. Given two or more strings, we are asked to compute a factor common to all strings that preserves a specific property and has maximal length. We consider three fundamental string properties: square-free factors, periodic factors, and palindromic factors under three different settings, one per property. In the first setting, we are given a string x and we are asked to construct a data structure over x answering the following type of online queries: given a string y, find a longest square-free factor common to x and y. In the second setting, we are given k strings and an integer and we are asked to find a longest periodic factor common to at least strings. In the third one, we are given two strings and we are asked to find a longest palindromic factor common to the two strings. We present linear-time solutions for all settings.
Articolo in rivista - Articolo scientifico
Palindromic factors, combinatorial algorithms, Square-free factors, Periodic factors
English
244
251
8
Ayad, L., Bernardini, G., Grossi, R., Iliopoulos, C., Pisanti, N., Pissis, S., et al. (2020). Longest property-preserved common factor: A new string-processing framework. THEORETICAL COMPUTER SCIENCE, 812, 244-251 [10.1016/j.tcs.2020.02.012].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/277037
Citazioni
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 1
Social impact