Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-03456-5_14 | Efficient Algorithms |
Keywords | Field | DocType |
former member,standard optimization technique,np-hard optimization problem,integer linear programming,young research field,optimization problem,computational molecular biology,computational biology,kurt mehlhorn,ilp-based approach,ilp-based technique | Mathematical optimization,Computational molecular biology,Computer science,Network alignment,Theoretical computer science,Integer linear programming formulation,Integer programming,Optimization problem | Conference |
Volume | ISSN | Citations |
5760 | 0302-9743 | 3 |
PageRank | References | Authors |
0.42 | 38 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ernst Althaus | 1 | 257 | 26.33 |
| Gunnar W. Klau | 2 | 869 | 55.67 |
| Oliver Kohlbacher | 3 | 975 | 101.91 |
| Hans-peter Lenhof | 4 | 615 | 64.08 |
| Knut Reinert | 5 | 1020 | 105.87 |