Heuristic algorithms in computational molecular biology
From MaRDI portal
Publication:619906
Recommendations
Cites work
Cited in
(9)- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
- A refined complexity analysis of degree anonymization in graphs
- The implicit hitting set approach to solve combinatorial optimization problems with an application to multigenome alignment
- On the role of metaheuristic optimization in bioinformatics
- Improved approximation algorithms for low-density instances of the minimum entropy set cover problem
- A heuristic algorithm to align protein interaction networks
- Heuristic algorithms for the maximum colorful subtree problem
- What Is Known About Vertex Cover Kernelization?
- A basic parameterized complexity primer
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)