Longest Common Prefixes with k-Errors and Applications

01/13/2018
by   Lorraine A. K. Ayad, et al.
0

Although real-world text datasets, such as DNA sequences, are far from being uniformly random, average-case string searching algorithms perform significantly better than worst-case ones in most applications of interest. In this paper, we study the problem of computing the longest prefix of each suffix of a given string of length n over a constant-sized alphabet that occurs elsewhere in the string with k-errors. This problem has already been studied under the Hamming distance model. Our first result is an improvement upon the state-of-the-art average-case time complexity for non-constant k and using only linear space under the Hamming distance model. Notably, we show that our technique can be extended to the edit distance model with the same time and space complexities. Specifically, our algorithms run in O(n ^k n n) time on average using O(n) space. We show that our technique is applicable to several algorithmic problems in computational biology and elsewhere.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/02/2022

Elastic-Degenerate String Matching with 1 Error

An elastic-degenerate string is a sequence of n finite sets of strings o...
research
05/13/2020

k-Approximate Quasiperiodicity under Hamming and Edit Distance

Quasiperiodicity in strings was introduced almost 30 years ago as an ext...
research
12/02/2018

Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations

Unbalanced translocations are among the most frequent chromosomal altera...
research
06/21/2018

Hardness and algorithmic results for the approximate cover problem

In CPM 2017, Amir et al. introduce a problem, named approximate string c...
research
05/25/2021

Minimal unique palindromic substrings after single-character substitution

A palindrome is a string that reads the same forward and backward. A pal...
research
12/25/2018

Deep neural networks are biased towards simple functions

We prove that the binary classifiers of bit strings generated by random ...
research
07/17/2020

Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction

We study the query complexity of exactly reconstructing a string from ad...

Please sign up or login with your details

Forgot password? Click here to reset