Longest Common Subsequence on Weighted Sequences

01/13/2019
by   Evangelos Kipouridis, et al.
0

We consider the general problem of the Longest Common Subsequence (LCS) on weighted sequences. Weighted sequences are an extension of classical strings, where in each position every letter of the alphabet may occur with some probability. In this paper we provide faster algorithms and prove a series of hardness results for more general variants of the problem. In particular, we provide an NP-Completeness result on the general variant of the problem instead of the log-probability version used in earlier papers, already for alphabets of size 2. Furthermore, we design an EPTAS for bounded alphabets, which is also an improved, compared to previous results, PTAS for unbounded alphabets. These are in a sense optimal, since it is known that there is no FPTAS for bounded alphabets, while we prove that there is no EPTAS for unbounded alphabets. Finally, we provide a matching conditional (under the Exponential Time Hypothesis) lower bound for any PTAS. As a side note, we prove that it is sufficient to work with only one threshold in the general variant of the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/28/2018

A Note on the Complexity of Manipulating Weighted Schulze Voting

We prove that the constructive weighted coalitional manipulation problem...
research
09/28/2017

Tight Conditional Lower Bounds for Longest Common Increasing Subsequence

We consider the canonical generalization of the well-studied Longest Inc...
research
10/02/2018

Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS

We study sketching and streaming algorithms for the Longest Common Subse...
research
09/07/2017

Detecting Patterns Can Be Hard: Circuit Lower Bounds for the String Matching Problem

Detecting patterns in strings and images is a fundamental and well studi...
research
09/25/2019

Weighted Shortest Common Supersequence Problem Revisited

A weighted string, also known as a position weight matrix, is a sequence...
research
09/26/2021

Preemptive Two-stage Goal-Programming Formulation of a Strict Version of the Unbounded Knapsack Problem with Bounded Weights

The unbounded knapsack problem with bounded weights is a variant of the ...
research
04/20/2020

Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions

Algorithms to find optimal alignments among strings, or to find a parsim...

Please sign up or login with your details

Forgot password? Click here to reset