Heuristic algorithms in computational molecular biology

DOI10.1016/j.jcss.2010.06.009zbMath1210.92003OpenAlexW2070135795MaRDI QIDQ619906

Richard M. 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

zbMATH Keywords

heuristic algorithmprotein interactionimplicit hitting setmulti-genome alignment

Mathematics Subject Classification ID

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

Related Items (5)

A Basic Parameterized Complexity Primer ⋮ What Is Known About Vertex Cover Kernelization? ⋮ Improved approximation algorithms for low-density instances of the minimum entropy set cover problem ⋮ Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics ⋮ A refined complexity analysis of degree anonymization in graphs

Uses Software

• Graemlin

Cites Work

• A polyhedral approach to sequence alignment problems
• Fast Heuristics for the Maximum Feasible Subsystem Problem
• A threshold of ln n for approximating set cover
• On the hardness of approximating minimization problems

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