Cart (Loading....) | Create Account
Close category search window
 

Drug Design using the Novel Directivity Genetic Algorithms and Lyapunov Stability Theorem to Decrease the Number of Binding Sites in Order to Enhance the Docking Performance

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

The application of the energy minimum to enhance the docking performance of CADD is discussed from three aspects, i.e. geometry, energy, and activity. This study applies the energy minimum theorem to solve the objection. A geometry search is performed and compared with the other four methods for classifying receptors. First, this work attempts to improve the speed of computer simulations of protein folding and to propose an improved genetic algorithm to accelerate the binding site search. Second, the paper focuses on energy theme. Lyapunov's stability theorem is adopted to decrease the number of binding sites, thus enhancing the docking performance in computer simulation examples. Finally, various drug-ligand interaction models are employed to compute docking simulations, while the energy minimum theorem is used to judge the approach approximately global energy minimum area and docking stability. This investigation develops the AMBER force field and Ullman's algorithm to support the computer simulation environments. The significance of the eigenvalue lambda is analyzed at each protein folding. Moreover, the performance of this study is increased by 25 percents comparing to various binding sites. Additionally, the protein folding and various bond forces in drug-ligand interaction model are discussed. Comparing with the other four geometry search methods and referring to the two been published paper written by Pegg and Camila, the improved genetic algorithms are specified to undertake the search binding site and docking. As a result, the global minimum search and the arithmetic convergence time of 1.16 hr can be obtained. Analytical results indicate that the improved genetic algorithm is better than the traditional random methods in terms of processing the geometry graphics operation.

Published in:

Machine Learning and Cybernetics, 2007 International Conference on  (Volume:6 )

Date of Conference:

19-22 Aug. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.