Huang X.
Arkansas State University, US
Keywords: computational biology, parameterized computation
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.
Journal: TechConnect Briefs
Volume: 1, Technical Proceedings of the 2005 NSTI Nanotechnology Conference and Trade Show, Volume 1
Published: May 8, 2005
Pages: 524 - 527
Industry sectors: Advanced Materials & Manufacturing | Medical & Biotech
Topics: Biomaterials, Informatics, Modeling & Simulation
ISBN: 0-9767985-0-6