Applications of Parameterized Computation in Computational Biology
According to the theory of NP-completeness, many problems that have important real-world applications in life science are NP-hard. This excludes the possibility of solving them in polynomial time unless P=NP. A number of approaches have [...]