Integer linear programming in computational biology

6Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Computational molecular biology (bioinformatics) is a young research field that is rich in NP-hard optimization problems. The problem instances encountered are often huge and comprise thousands of variables. Since their introduction into the field of bioinformatics in 1997, integer linear programming (ILP) techniques have been successfully applied to many optimization problems. These approaches have added much momentum to development and progress in related areas. In particular, ILP-based approaches have become a standard optimization technique in bioinformatics. In this review, we present applications of ILP-based techniques developed by members and former members of Kurt Mehlhorn's group. These techniques were introduced to bioinformatics in a series of papers and popularized by demonstration of their effectiveness and potential. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Althaus, E., Klau, G. W., Kohlbacher, O., Lenhof, H. P., & Reinert, K. (2009). Integer linear programming in computational biology. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5760 LNCS, pp. 199–218). https://doi.org/10.1007/978-3-642-03456-5_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free