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

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 xand we are asked to construct a data structure over xanswering the following type of online queries: given a string y, find a longest square-free factor common to xand y. In the second setting, we are given kstrings and an integer 1