Heuristic algorithms in computational molecular biology

DOI10.1016/J.JCSS.2010.06.009zbMATH Open1210.92003OpenAlexW2070135795MaRDI QIDQ619906FDOQ619906

Authors: Richard Karp 

Publication date: 18 January 2011

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2010.06.009

Recommendations

• On some optimization problems in molecular biology
• A heuristic algorithm to align protein interaction networks
• scientific article; zbMATH DE number 1154743
• scientific article; zbMATH DE number 1088267
• scientific article

zbMATH Keywords

heuristic algorithmprotein interactionimplicit hitting setmulti-genome alignment

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Nonnumerical algorithms (68W05) Computational methods for problems pertaining to biology (92-08)

Cites Work

• A threshold of ln n for approximating set cover
• On the hardness of approximating minimization problems
• A polyhedral approach to sequence alignment problems
• Fast heuristics for the maximum feasible subsystem problem

Cited In (9)

• A heuristic algorithm to align protein interaction networks
• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
• Improved approximation algorithms for low-density instances of the minimum entropy set cover problem
• A basic parameterized complexity primer
• The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment
• Heuristic algorithms for the maximum colorful subtree problem
• On the role of metaheuristic optimization in bioinformatics
• What Is Known About Vertex Cover Kernelization?
• A refined complexity analysis of degree anonymization in graphs

Uses Software

• Graemlin

This page was built for publication: Heuristic algorithms in computational molecular biology

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q619906)