An improved lower bound on approximation algorithms for the Closest Substring problem

The Closest Substring problem (the CSP problem) is a basic NP-hard problem in the study of computational biology. It is known that the problem has polynomial time approximation schemes. In this paper, we prove that unless the Exponential Time Hypothesis fails, the CSP problem has no polynomial time...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters Jg. 107; H. 1; S. 24 - 28
Hauptverfasser:	Wang, Jianxin, Chen, Jianer, Huang, Min
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 30.06.2008 Elsevier Science Elsevier Sequoia S.A
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Analysis of algorithms Applied sciences Approximation Approximation algorithms Approximations and expansions Closest substring problem Computational biology Computer science; control theory; systems Errors Exact sciences and technology Lower bound Mathematical analysis Mathematics Miscellaneous Sciences and techniques of general use Studies Theoretical computing Closest substring problem Lower bound Approximation algorithms Analysis of algorithms Computational biology Polynomial Error estimation Computer theory Polynomial approximation Biology Approximation algorithm Hypothesis Polynomial time NP hard problem Information processing Algorithm analysis
ISSN:	0020-0190, 1872-6119
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!