Open AccessJournal Article
Multivariate Algorithmics for NP-Hard String Problems
TL;DR: This work surveys parameterized and multivariate algorithmics results for NP-hard string problems and identifies challenges for future research.
read more
Abstract: String problems arise in various applications ranging from text mining to biological sequence analysis. Many string problems are NP-hard. This motivates the search for (fixed-parameter) tractable special cases of these problems. We survey parameterized and multivariate algorithmics results for NP-hard string problems and identify challenges for future research.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Combinatorial n-fold Integer Programming and Applications
TL;DR: In this paper, a single-exponential algorithm for combinatorial n-fold integer programs, which are remarkably similar to prior ILP formulations for various problems, also allow variable dimension.
42
Combinatorial n -fold integer programming and applications
TL;DR: A single-exponential algorithm for so-called combinatorial n-fold integer programs, which is remarkably similar to prior ILP formulations for various problems, but unlike them, also allow variable dimension.
Reconstructing Point Sets From Distance Distributions
Shuai Huang,Ivan Dokmanic +1 more
TL;DR: This paper is the first practical approach to solve the large-scale noisy beltway problem where the points lie on a loop using projected gradient descent with a suitable spectral initializer and is robust to noise in the measurements.
33
On the Kernelization Complexity of String Problems
Manu Basavaraju,Fahad Panolan,Ashutosh Rai,M. S. Ramanujan,Saket Saurabh +4 more
- 19 Jun 2018
TL;DR: This paper does a comprehensive study of Closest String problems from kernelization complexity perspective and almost settles all the problems by either obtaining a polynomial kernel or showing that the problem does not admit a poynomial kernel assuming a complexity theoretic assumption.
13
•Posted Content
Hardness of Consensus Problems for Circular Strings and Time Series Averaging.
TL;DR: This work answers the main open question concerning the computational complexity of exact mean computation in dynamic time warping spaces and introduces a much more general family of circular consensus string problems that also serves as a key for the hardness reductions.
10
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Parameterized complexity theory
Jörg Flum,Martin Grohe +1 more
- 01 Jan 2010
TL;DR: Fixed-Parameter Tractability.
2.7K
•Book
Fundamentals of Parameterized Complexity
Rodney G. Downey,Michael R. Fellows +1 more
- 06 Dec 2013
TL;DR: This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research.
1.9K
•Book
Invitation to fixed-parameter algorithms
Rolf Niedermeier
- 01 Jan 2006
TL;DR: This paper discusses Fixed-Parameter Algorithms, Parameterized Complexity Theory, and Selected Case Studies, and some of the techniques used in this work.
1.9K
Related Papers (5)
Moti Frances,Ami Litman +1 more
Rodney G. Downey,Michael R. Fellows +1 more
- 06 Dec 2013
Jörg Flum,Martin Grohe +1 more
- 01 Jan 2010