Skip to Main content Skip to Navigation
Journal articles

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

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 1 < k ≤ k and we are asked to find a longest periodic factor common to at least k 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. This is a full and extended version of a paper from SPIRE 2018.
Document type :
Journal articles
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal.inria.fr/hal-02956135
Contributor : Marie-France Sagot <>
Submitted on : Friday, October 2, 2020 - 2:15:25 PM
Last modification on : Wednesday, October 14, 2020 - 3:44:34 AM

File

LPPCF_journalVersion_TCS.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Lorraine A.K. Ayad, Giulia Bernardini, Roberto Grossi, Costas Iliopoulos, Nadia Pisanti, et al.. Longest property-preserved common factor: A new string-processing framework. Theoretical Computer Science, Elsevier, 2020, 812, pp.244-251. ⟨10.1016/j.tcs.2020.02.012⟩. ⟨hal-02956135⟩

Share

Metrics

Record views

21

Files downloads

118