Abstract
Given n length-L strings S = {s 1, …, s n } over a constant size alphabet Σ together with an integer ℓ, where ℓ ≤ L, the objective of Consensus Patterns is to find a length-ℓ string s, a substring t i of each s i in S such that ∑ ∀ i d(t i , s) is minimized. Here d(x, y) denotes the Hamming distance between the two strings x and y. Consensus Patterns admits a PTAS [Li et al., JCSS 2002] is fixed parameter tractable when parameterized by the objective function value [Marx, SICOMP 2008], and although it is a well-studied problem, improvement of the PTAS to an EPTAS seemed elusive. We prove that Consensus Patterns does not admit an EPTAS unless FPT=W[1], answering an open problem from [Fellows et al., STACS 2002, Combinatorica 2006]. To the best of our knowledge, Consensus Patterns is the first problem that admits a PTAS, and is fixed parameter tractable when parameterized by the value of the objective function but does not admit an EPTAS under plausible complexity assumptions. The proof of our hardness of approximation result combines parameterized reductions and gap preserving reductions in a novel manner.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alon, N., Goldreich, O., Håstad, J., Peralta, R.: Simple Construction of Almost k-wise Independent Random Variables. Random Struct. Algor. 3(3), 289–304 (1992)
Arora, S.: Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems. In: Proc of 37th FOCS, pp. 2–11 (1996)
Arora, S.: Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. J. ACM 5, 753–782 (1998)
Bazgan, C.: Schémas d’approximation et complexité paramétrée. Technical report, Université Paris Sud (1995)
Brejová, B., Brown, D.G., Harrower, I.M., Vinař, T.: New Bounds for Motif Finding in Strong Instances. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 94–105. Springer, Heidelberg (2006)
Brejová, B., Brown, D.G., Harrower, I.M., López-Ortiz, A., Vinař, T.: Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 1–10. Springer, Heidelberg (2005)
Cygan, M., Fomin, F.V., Lokshtanov, D., Kowalik, L., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015)
Lo, C., Kakaradov, B., Lokshtanov, D., Boucher, C.: SeeSite: Efficiently Finding Co-occurring Splice Sites and Exon Splicing Enhancers. arXiv:1206.5846v1
Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer (2013)
Fellows, M.R., Gramm, J., Niedermeier, R.: On the parameterized intractability of motif search problems. Combinatorica 26, 141–167 (2006)
Fellows, M.R., Hermelin, D., Rosamond, F.A., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theor. Comput. Sci. 410(1), 53–61 (2009)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
Grimmett, F., Stirzaker, D.: Probability and random processes, vol. 3. Oxford University Press (2001)
Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. J. Amer. Statistical Assoc. 58(301), 13–30 (1963)
Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. J. Algorithms 26(2), 238–274 (1998)
Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inform. Comput. 185(1), 41–55 (2003)
Li, M., Ma, B., Wang, L.: Finding similar regions in many sequences. J. Comput. System Sci. 65(1), 73–96 (2002)
Marx, D.: Closest Substring Problems with Small Distances. SIAM J. Comput. 38(4), 1283–1410 (2008)
Marx, D.: Efficient Approximation Schemes for Geometric Problems? In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 448–459. Springer, Heidelberg (2005)
Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60–78 (2008)
Naor, J., Naor, M.: Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. 22(4), 838–856 (1993)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)
Pevzner, P., Sze, S.: Combinatorial approaches to finding subtle signals in DNA strings. In: Proc. of the 8th ISMB, pp. 269–278 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boucher, C., Lo, C., Lokshantov, D. (2015). Consensus Patterns (Probably) Has no EPTAS. In: Bansal, N., Finocchi, I. (eds) Algorithms - ESA 2015. Lecture Notes in Computer Science(), vol 9294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48350-3_21
Download citation
DOI: https://doi.org/10.1007/978-3-662-48350-3_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48349-7
Online ISBN: 978-3-662-48350-3
eBook Packages: Computer ScienceComputer Science (R0)