On the parameterized intractability of motif search problems

Combinatorica

Volumn 26, Issue 2, 2006, Pages 141-167

  Fellows, Michael R ^a   Gramm, Jens ^b   Niedermeier, Rolf ^c  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF TÜBINGEN   (Germany)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749345269     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-006-0011-4     Document Type: Article

References (36)

1. J. ALBER, J. GRAMM and R. NIEDERMEIER: Faster exact solutions for hard problems: a parameterized point of view, Discrete Mathematics 229(1-3) (2001), 3-27.
2. M. BLANCHETTE, B. SCHWIKOWSKI and M. TOMPA: Algorithms for phylogenetic footprinting, Journal of Computational Biology 9(2) (2002), 211-224.
3. H. L. BODLAENDER, R. G. DOWNEY, M. R. FELLOWS and H. T. WAREHAM: The parameterized complexity of sequence alignment and consensus, Theoretical Computer Science 147 (1995), 31-54.
4. H. L. BODLAENDER, R. G. DOWNEY, M. R. FELLOWS, M. T. HALLETT and H. T. WAREHAM: Parameterized complexity analysis in computational biology, Computer Applications in the Biosciences 11 (1995), 49-57.
5. J. BUHLER and M. TOMPA: Finding motifs using random projections, Journal of Computational Biology 9(2) (2002), 225-242.
6. M. CESATI and L. TREVISAN: On the efficiency of polynomial time approximation schemes, Information Processing Letters 64(4) (1997), 165-171.
7. J. CHEN, I. KANJ and W. JIA: Vertex Cover: further observations and further improvements, Journal of Algorithms 41(2) (2001), 280-301.
8. D. COPPERSMITH and S. WINOGRAD: Matrix multiplication via arithmetical progression, Journal of Symbolic Computations 9 (1990), 251-280.
9. X. DENG, G. LI, Z. LI, B. MA and L. WANG: Genetic Design of Drug without Side Effects, SIAM Journal on Computing 32(4) (2003), 1073-1090.
10. R. G. DOWNEY: Parameterized complexity for the skeptic, in Proc. of the 18th Annual IEEE Conference on Computational Complexity (CCC), pages 147-168, 2003, IEEE Computer Society Press.
11. R. G. DOWNEY and M. R. FELLOWS: Fixed-parameter tractability and completeness II: On completeness for W[1], Theoretical Computer Science 141 (1995), 109-131.
12. R. G. DOWNEY and M. R. FELLOWS: Parameterized Complexity, Springer, 1999.
13. P. A. EVANS and H. T. WAREHAM: Practical Algorithms for Universal DNA Primer Design: An Exercise in Algorithm Engineering, in N. El-Mabrouk, T. Lengauer and D. Sankoff (eds.) Currents in Computational Molecular Biology 2001, pages 25-26, Les Publications CRM, Montreal, 2001.
14. P. A. EVANS, A. D. SMITH and H. T. WAREHAM: On the complexity of finding common approximate substrings, Theoretical Computer Science 306(1-3) (2003), 407-430.
15. M. R. FELLOWS: Parameterized complexity: the main ideas and connections to practical computing, in Experimental Algorithmics, volume 2547 in LNCS, pages 51-77, 2002, Springer.
16. M. R. FELLOWS: Blow-ups, win/win's, and crown rules: some new directions in FPT; in Proc. of the 29th WG, volume 2880 in LNCS, pages 1-12, 2003, Springer.
17. M. R. FELLOWS: New directions and new challenges in algorithm design and complexity, parameterized; in Proc. of the 8th WADS, volume 2748 in LNCS, pages 505-520, 2003, Springer.
18. M. FRANCES and A. LITMAN: On covering problems of codes, Theory of Computing Systems 30 (1997), 113-119.
19. J. GRAMM, J. GUO and R. NIEDERMEIER: On exact and approximation algorithms for distinguishing substring selection, in Proc. of the 14th FCT, volume 2751 in LNCS, pages 195-209, 2003, Springer.
20. Long version to appear under the title "Parameterized intractability of Distinguishing Substring Selection" in Theory of Computing Systems.
21. J. GRAMM, F. HÜFFNER and R. NIEDERMEIER: Closest strings, primer design, and motif search; in L. Florea et al. (eds), Currents in Computational Molecular Biology 2002, poster abstracts of RECOMB 2002, pages 74-75.
22. J. GRAMM, R. NIEDERMEIER and P. ROSSMANITH: Fixed-parameter algorithms for Closest String and related problems, Algorithmica 37(1) (2003), 25-42.
23. M. T. HALLETT: An Integrated Complexity Analysis of Problems from Computational Biology, PhD Thesis, University of Victoria, Canada, 1996.
24. J. K. LANCTOT, M. LI, B. MA, S. WANG and L. ZHANG: Distinguishing String Search Problems, Information and Computation 185 (2003), 41-55.
25. M. LI, B. MA and L. WANG: Finding similar regions in many strings, in Proc. of 31st ACM STOC, pages 473-482, 1999, ACM Press. Preliminary version of [25] and [26].
26. M. LI, B. MA and L. WANG: Finding similar regions in many sequences, Journal of Computer and System Sciences 65(1) (2002), 73-96.
27. M. LI, B. MA and L. WANG: On the Closest String and Substring Problems, Journal of the ACM 49(2) (2002), 157-171.
28. D. MARX: The Closest Substring problem with small distances, in Proc. of the 46th FOCS, pages 63-72, 2005, IEEE Press.
29. J. NEŠETŘIL and S. POLJAK: On the complexity of the subgraph problem, Commentationes Mathematicae Universitatis Carolinae 26(2) (1985), 415-419.
30. R. NIEDERMEIER: Ubiquitous parameterization - invitation to fixed-parameter algorithms, in Proc. of 29th MFCS, volume 3153 in LNCS, pages 84-103, 2004, Springer.
31. R. NIEDERMEIER: Invitation to Fixed-Parameter Algorithms, Oxford University Press, 2006.
32. R. NIEDERMEIER and P. ROSSMANITH: Upper bounds for Vertex Cover further improved, in Proc. of 16th STACS, volume 1563 in LNCS, pages 561-570, 1999, Springer.
33. P. A. PEVZNER: Computational Molecular Biology - An Algorithmic Approach, The MIT Press, 2000.
34. P. A. PEVZNER and S.-H. SZE: Combinatorial approaches to finding subtle signals in DNA sequences, in Proc. of 8th ISMB, pages 269-278, 2000, AAAI Press.
35. K. PIETRZAK: On the parameterized complexity of the fixed alphabet Shortest Common Supersequence and Longest Common Subsequence problems, Journal of Computer and System Sciences 67(1) (2003), 757-771.
36. M.-F. SAGOT: Spelling approximate repeated or common motifs using a suffix tree, in Proc. of the 3rd LATIN, volume 1380 in LNCS, pages 111-127, 1998, Springer.