By Topic

A deterministic annealing approach to combinatorial library design for drug discovery

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)
Sharma, P. ; Coordinated Sci. Lab, Illinois Univ., Champaign, IL, USA ; Salapaka, S. ; Beck, C.

In this paper we propose a new algorithm for the design of a lead generation library for the purpose of drug discovery. The algorithm is based on a modification of the deterministic annealing algorithm used for clustering and locational optimization problems. The algorithm addresses two key criteria namely, diversity and representativeness of compounds in the obtained library. Thus the time-intensive process of finding a lead compound for drug discovery can he accelerated using this technique of library design.

Published in:

American Control Conference, 2005. Proceedings of the 2005

Date of Conference:

8-10 June 2005