An ant algorithm for the conformational analysis of flexible molecules

Originally, the ant system was developed for optimization in discrete search spaces such as the traveling salesman problem. We detail our adaptation of the algorithm to optimization in the continuous search space of conformational analysis. The parameters of the algorithm were tuned using a simple t...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational chemistry Vol. 28; no. 5; pp. 890 - 898
Main Authors Daeyaert, Frits, De Jonge, Marc, Koymans, Luc, Vinkers, Maarten
Format Journal Article
LanguageEnglish
Published Hoboken Wiley Subscription Services, Inc., A Wiley Company 15.04.2007
Wiley Subscription Services, Inc
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Originally, the ant system was developed for optimization in discrete search spaces such as the traveling salesman problem. We detail our adaptation of the algorithm to optimization in the continuous search space of conformational analysis. The parameters of the algorithm were tuned using a simple test molecule, undecane, and a drug molecule, imatinib. The algorithm is further tested on four more drug or drug‐like molecules, on vitamin A and on alanine tetrapeptide. © 2007 Wiley Periodicals, Inc. J Comput Chem, 2007
Bibliography:ArticleID:JCC20595
istex:3BD0EAEE34C7629B9E295CCD1722A98F212F9815
ark:/67375/WNG-DBMVMWFJ-P
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0192-8651
1096-987X
DOI:10.1002/jcc.20595