On Abelian Longest Common Factor with and without RLE

04/18/2018
by   Szymon Grabowski, et al.
0

We consider the Abelian longest common factor problem in two scenarios: when input strings are uncompressed and are of size n, and when the input strings are run-length encoded and their compressed representations have size at most m. The alphabet size is denoted by σ. For the uncompressed problem, we show an o(n^2)-time and (n)-space algorithm in the case of σ=(1), making a non-trivial use of tabulation. For the RLE-compressed problem, we show two algorithms: one working in (m^2σ^2 ^3 m) time and (m (σ^2+^2 m)) space, which employs line sweep, and one that works in (m^3) time and (m) space that applies in a careful way a sliding-window-based approach. The latter improves upon the previously known (nm^2)-time and (m^4)-time algorithms that were recently developed by Sugimoto et al. (IWOCA 2017) and Grabowski (SPIRE 2017), respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/13/2017

Closing in on Time and Space Optimal Construction of Compressed Indexes

Fast and space-efficient construction of compressed indexes such as comp...
research
05/25/2022

Substring Complexities on Run-length Compressed Strings

Let S_T(k) denote the set of distinct substrings of length k in a string...
research
01/18/2022

Computing Longest (Common) Lyndon Subsequences

Given a string T with length n whose characters are drawn from an ordere...
research
02/16/2018

Online LZ77 Parsing and Matching Statistics with RLBWTs

Lempel-Ziv 1977 (LZ77) parsing, matching statistics and the Burrows-Whee...
research
07/04/2023

Sliding suffix trees simplified

Sliding suffix trees (Fiala Greene, 1989) for an input text T over a...
research
05/11/2019

Cost-Based Approach to Complexity: A Common Denominator?

Complexity remains one of the central challenges in science and technolo...
research
05/12/2023

Matching Statistics speed up BWT construction

Due to the exponential growth of genomic data, constructing dedicated da...

Please sign up or login with your details

Forgot password? Click here to reset