License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2017.13
URN: urn:nbn:de:0030-drops-81753
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/8175/
Goldwasser, Shafi ;
Holden, Dhiraj
The Complexity of Problems in P Given Correlated Instances
Abstract
Instances of computational problems do not exist in isolation. Rather, multiple and correlated instances of the same problem arise naturally in the real world. The challenge is how to gain computationally from correlations when they can be found.
[DGH, ITCS 2015] showed that significant computational gains can be made by having access to auxiliary instances which are correlated to the primary problem instance via the solution space. They demonstrate this for constraint satisfaction problems, which are NP-hard in the general worst case form.
Here, we set out to study the impact of having access to correlated instances on the complexity of polynomial time problems. Namely, for a problem P that is conjectured to require time n^c for c>0,
we ask whether access to a few instances of P that are correlated in some natural way can be used to solve P on one of them (the designated "primary instance") faster than the conjectured lower bound of n^c.
We focus our attention on a number of problems: the Longest Common Subsequence (LCS), the minimum Edit Distance between sequences, and Dynamic Time Warping Distance (DTWD) of curves, for all of which the best known algorithms achieve O(n^2/polylog(n)) runtime via dynamic programming. These problems form an interesting case in point to study, as it has been shown that a O(n^(2 - epsilon)) time algorithm for a worst-case instance would imply improved algorithms
for a host of other problems as well as disprove complexity hypotheses such as the Strong Exponential Time Hypothesis.
We show how to use access to a logarithmic number of auxiliary correlated instances, to design novel o(n^2) time algorithms for LCS, EDIT, DTWD, and more generally improved algorithms for computing any tuple-based similarity measure - a generalization which we define within on strings. For the multiple sequence alignment problem on k strings, this yields an O(nk\log n) algorithm
contrasting with classical O(n^k) dynamic programming.
Our results hold for several correlation models between the primary and the auxiliary instances. In the most general correlation model we address, we assume that the primary instance is a worst-case instance and the auxiliary instances are chosen with uniform distribution subject to the constraint that their alignments are
epsilon-correlated with the optimal alignment of the primary instance. We emphasize that optimal solutions for the auxiliary instances will not generally coincide with optimal solutions for the worst case primary instance.
We view our work as pointing out a new avenue for looking for significant improvements for sequence alignment problems and
computing similarity measures, by taking advantage of access to sequences which are correlated through natural generating processes.
In this first work we show how to take advantage of mathematically inspired simple clean models of correlation - the intriguing question, looking forward, is to find correlation models which coincide with evolutionary models and other relationships and for which our approach to multiple sequence alignment gives provable guarantees.
BibTeX - Entry
@InProceedings{goldwasser_et_al:LIPIcs:2017:8175,
author = {Shafi Goldwasser and Dhiraj Holden},
title = {{The Complexity of Problems in P Given Correlated Instances}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {13:1--13:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Christos H. Papadimitriou},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8175},
URN = {urn:nbn:de:0030-drops-81753},
doi = {10.4230/LIPIcs.ITCS.2017.13},
annote = {Keywords: Correlated instances, Longest Common Subsequence, Fine-grained complexity}
}
|
Keywords: |
|
Correlated instances, Longest Common Subsequence, Fine-grained complexity |
|
Collection: |
|
8th Innovations in Theoretical Computer Science Conference (ITCS 2017) |
|
Issue Date: |
|
2017 |
|
Date of publication: |
|
28.11.2017 |
