Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Ultrafast algorithm for designing focused combinational arrays

Agrafiotis1, Lobanov

  • 13-Dimensional Pharmaceuticals, Inc., Exton, Pennsylvania 19341, USA. dimitris@3dp.com

Journal of Chemical Information and Computer Sciences
|August 24, 2000
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Stochastic similarity selections from large combinatorial libraries

Journal of chemical information and computer sciences·2000
Same author

Structurally diverse quantitative structure--property relationship correlations of technologically relevant physical properties

Journal of chemical information and computer sciences·2000
Same author

Prediction of Critical Micelle Concentration Using a Quantitative Structure-Property Relationship Approach

Journal of colloid and interface science·1997
Same author

alpha decay of 273110: Shell closure at N=162.

Physical review. C, Nuclear physics·1996
Same author

New Nuclide 267108 Produced by the 238U+34S Reaction.

Physical review letters·1995
Same author

Discovery of enhanced nuclear stability near the deformed shells N=162 and Z=108.

Physical review letters·1994
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
Same journal

Future Papers.

Journal of chemical information and computer sciences·2016
See all related articles

A new greedy algorithm rapidly designs focused combinatorial libraries. This computational chemistry method efficiently identifies optimal molecular structures for drug discovery and materials science applications.

Area of Science:

  • Computational chemistry
  • Drug discovery
  • Materials science

Background:

  • Combinatorial libraries are crucial for identifying novel compounds.
  • Existing methods for designing these libraries are often computationally intensive.
  • Efficient algorithms are needed to accelerate the discovery process.

Purpose of the Study:

  • To present a novel greedy algorithm for designing focused combinatorial arrays.
  • To demonstrate the algorithm's applicability to various design objectives.
  • To offer a computationally efficient alternative to existing methods.

Main Methods:

  • A greedy algorithm utilizing a heuristic for independent evaluation and ranking of reagents.
  • Applicable objective functions decomposable to individual molecular contributions.

Related Experiment Videos

  • Independent evaluation and ranking of candidate reagents at each variation site.

    • Main Results:

    • The algorithm is extremely fast and convergent.
    • Solutions are comparable or superior to stochastic sampling techniques.
    • Demonstrated applicability to objectives like lead similarity, predicted activity, and property bounds.

    Conclusions:

    • The novel greedy algorithm provides an efficient and effective approach for designing focused combinatorial libraries.
    • This method accelerates the identification of molecules with desired properties.
    • It offers a significant computational advantage over traditional methods.