GI LogoGI Logo
  • Login
Digital Library
    • All of DSpace

      • Communities & Collections
      • Titles
      • Authors
      • By Issue Date
      • Subjects
    • This Collection

      • Titles
      • Authors
      • By Issue Date
      • Subjects
Digital Library Gesellschaft für Informatik e.V.
GI-DL
    • English
    • Deutsch
  • English 
    • English
    • Deutsch
View Item 
  •   DSpace Home
  • Lecture Notes in Informatics
  • Proceedings
  • German Conference on Bioinformatics
  • P071 - GCB 2005 - German Conference on Bioinformatics
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
  •   DSpace Home
  • Lecture Notes in Informatics
  • Proceedings
  • German Conference on Bioinformatics
  • P071 - GCB 2005 - German Conference on Bioinformatics
  • View Item

From greedy to branch & bound and back: assessing optimization strategies for incremental construction molecular docking tools

Author:
Griewel, Axel [DBLP] ;
Rarey, Matthias [DBLP]
Abstract
A branch & bound approach for the assembly-phase of the incremental construction algorithm of the software package FlexX is presented. For this a local bound for partial solutions has been implemented which estimates the best score achievable for the considered solutions. This estimation is based on scoring values which single components can achieve in certain regions of the active site as well as distance constraints deduced from the composition of the considered partial solution. Furthermore, a timeand space-bounded search strategy specific to the addressed problem has been developed. The implemented algorithm was tested on a dataset containing 169 complexes. In 116 of these cases the calculation was finished in a reasonably defined time frame while the calculation for the remaining complexes was not completed in this period of time. For all calculated complexes, the best solution shows a score better or equal to the solution of standard-FlexX. This, however, is not always associated with an improvement of the RMSD between the calculated placement of the ligand and the crystal structure. The presented algorithm is applicable for thorough virtual screening of small sets of ligands comprising up to nine rotatable, acyclic bonds. Furthermore, the method gives important insights to the k-greedy method and can be used for scientific assessment of new scoring functions within FlexX.
  • Citation
  • BibTeX
Griewel, A. & Rarey, M., (2005). From greedy to branch & bound and back: assessing optimization strategies for incremental construction molecular docking tools. In: Torda, A., Kurtz, S. & Rarey, M. (Hrsg.), German Conference on Bioinformatics 2005 (GCB 2005). Bonn: Gesellschaft für Informatik e.V.. (S. 119-130).
@inproceedings{mci/Griewel2005,
author = {Griewel, Axel AND Rarey, Matthias},
title = {From greedy to branch & bound and back: assessing optimization strategies for incremental construction molecular docking tools},
booktitle = {German Conference on Bioinformatics 2005 (GCB 2005)},
year = {2005},
editor = {Torda, Andrew AND Kurtz, Stefan AND Rarey, Matthias} ,
pages = { 119-130 },
publisher = {Gesellschaft für Informatik e.V.},
address = {Bonn}
}
DateienGroesseFormatAnzeige
GI-Proceedings.71-13.pdf249.1Kb PDF View/Open

Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Send Feedback

More Info

ISBN: 3-88579-400-4
ISSN: 1617-5468
xmlui.MetaDataDisplay.field.date: 2005
Language: en (en)
Content Type: Text/Conference Paper
Collections
  • P071 - GCB 2005 - German Conference on Bioinformatics [22]

Show full item record


About uns | FAQ | Help | Imprint | Datenschutz

Gesellschaft für Informatik e.V. (GI), Kontakt: Geschäftsstelle der GI
Diese Digital Library basiert auf DSpace.

 

 


About uns | FAQ | Help | Imprint | Datenschutz

Gesellschaft für Informatik e.V. (GI), Kontakt: Geschäftsstelle der GI
Diese Digital Library basiert auf DSpace.