## Parameterized Complexity Analysis in Computational Biology (1995)

Venue: | Comput. Appl. Biosci |

Citations: | 9 - 4 self |

### BibTeX

@ARTICLE{Bodlaender95parameterizedcomplexity,

author = {Hans Bodlaender and Rodney G. Downey and Michael R. Fellows and Michael T. Hallett and H. Todd Wareham},

title = {Parameterized Complexity Analysis in Computational Biology},

journal = {Comput. Appl. Biosci},

year = {1995},

volume = {11},

pages = {49--57}

}

### Years of Citing Articles

### OpenURL

### Abstract

Many computational problems in biology involve parameters for which a small range of values cover important applications. We argue that for many problems in this setting, parameterized computational complexity rather than NP-completeness is the appropriate tool for studying apparent intractability. At issue in the theory of parameterized complexity is whether a problem can be solved in time O(n ff ) for each fixed parameter value, where ff is a constant independent of the parameter. In addition to surveying this complexity framework, we describe a new result for the Longest common subsequence problem. In particular, we show that the problem is hard for W [t] for all t when parameterized by the number of strings and the size of the alphabet. Lower bounds on the complexity of this basic combinatorial problem imply lower bounds on more general sequence alignment and consensus discovery problems. We also describe a number of open problems pertaining to the parameterized complexity of pro...