DeepAI AI Chat
Log In Sign Up

On Longest Common Property Preserved Substring Queries

06/13/2019
by   Kazuki Kai, et al.
KYUSHU UNIVERSITY
University of Warsaw
0

We revisit the problem of longest common property preserving substring queries introduced by Ayad et al. (SPIRE 2018, arXiv 2018). We consider a generalized and unified on-line setting, where we are given a set X of k strings of total length n that can be pre-processed so that, given a query string y and a positive integer k'≤ k, we can determine the longest substring of y that satisfies some specific property and is common to at least k' strings in X. Ayad et al. considered the longest square-free substring in an on-line setting and the longest periodic and palindromic substring in an off-line setting. In this paper, we give efficient solutions in the on-line setting for finding the longest common square, periodic, palindromic, and Lyndon substrings. More precisely, we show that X can be pre-processed in O(n) time resulting in a data structure of O(n) size that answers queries in O(|y|σ) time and O(1) working space, where σ is the size of the alphabet, and the common substring must be a square, a periodic substring, a palindrome, or a Lyndon word.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/04/2018

Longest Property-Preserved Common Factor

In this paper we introduce a new family of string processing problems. W...
06/25/2018

Fast entropy-bounded string dictionary look-up with mismatches

We revisit the fundamental problem of dictionary look-up with mismatches...
04/17/2020

Faster Approximate Pattern Matching: A Unified Approach

Approximate pattern matching is a natural and well-studied problem on st...
10/05/2022

Internal Longest Palindrome Queries in Optimal Time

Palindromes are strings that read the same forward and backward. Problem...
04/18/2018

On Abelian Longest Common Factor with and without RLE

We consider the Abelian longest common factor problem in two scenarios: ...
11/14/2022

Augmented Thresholds for MONI

MONI (Rossi et al., 2022) can store a pangenomic dataset T in small spac...
06/28/2022

Extending Shinohara's Algorithm for Computing Descriptive (Angluin-Style) Patterns to Subsequence Patterns

The introduction of pattern languages in the seminal work [Angluin, “Fin...