![]() | Nanotech 2005 Vol. 1
Technical Proceedings of the 2005 NSTI Nanotechnology Conference and Trade Show, Volume 1
Chapter 9: Computational Biology |
Applications of Parameterized Computation in Computational Biology | |
| Authors: | X. Huang |
| Affilation: | Arkansas State University, US |
| Pages: | 524 - 527 |
| Keywords: | parameterized computation, computational biology |
| Abstract: | 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 been proposed in dealing with NP-hard problems. For example, The highly acclaimed approximation approach tries to come up with a good enough solution in polynomial time instead of an optimal solution for an NP-hard optimization problem. Parameterized computation is a newly developed approach, which tries to give exact solutions when a natural parameter is small. Here we present a summary of our recent research work on applications of parameterized computation in computational biology. |
![]() | View PDF of paper |
| ISBN: | 0-9767985-0-6 |
| Pages: | 844 |
| Hardcopy: | $109.95 |
| Order: | Mail/Fax Form |
| Special: | 3 CD Set — 15% off with Free Shipping |
| Up |







