J Chem Inf Model
February 2009
Molecules are often represented as bit string fingerprints in databases. These bit strings are used for similarity searching using the Tanimoto coefficient and rapid indexing. A new data structure is introduced, the compressed bit binary tree, that rapidly increases search and indexing times by up to a factor of 30.
View Article and Find Full Text PDFThere have been many tools and methods developed to investigate structure-activity (SAR) and structure-property (SPR) relationships. Many of these tools are fully or almost fully automated and attempt to predict various properties of molecules. Even with these tools, there is still an urgent need to provide a simple and useful methodology so a consumer of these various models, such as a medicinal chemist or molecular modeler, can learn how various properties of small molecules relate to their structure.
View Article and Find Full Text PDFComb Chem High Throughput Screen
February 2006
High throughput screening (HTS) campaigns, where laboratory automation is used to expose biological targets to large numbers of materials from corporate compound collections, have become commonplace within the lead generation phase of pharmaceutical discovery. Advances in genomics and related fields have afforded a wealth of targets such that screening facilities at larger organizations routinely execute over 100 hit-finding campaigns per year. Often, 10(5) or 10(6) molecules will be tested within a campaign/cycle to locate a large number of actives requiring follow-up investigation.
View Article and Find Full Text PDFHigh content screening is a method for identifying small molecule modulators of mammalian cell biology. The nature of the experiment generates an enormous amount of data in the form of photographic images of cells after treatment with compounds of interest. The interpretation of data from these experiments is challenging both in terms of automatically perceiving the images, extracting, and understanding differences between screened compounds and visualizing the results.
View Article and Find Full Text PDFJ Comput Aided Mol Des
July 2005
Structure-based screening using fully flexible docking is still too slow for large molecular libraries. High quality docking of a million molecule library can take days even on a cluster with hundreds of CPUs. This performance issue prohibits the use of fully flexible docking in the design of large combinatorial libraries.
View Article and Find Full Text PDFAnn Clin Biochem
November 2005
Background: Increasing activity in cholesterol lowering is placing increasing demands on lipid clinics to be able to cope with the increase in demand. A combination of interventions has been used to improve laboratory testing, focus interpretative results and provide educational and advisory facilities for general practitioners in order to increase shared care of many potential clinic patients.
Methods: Retrospective study of clinic waiting times, results in patients managed on a shared care basis, and overall clinical activity over a three-and-a-half-year intervention period between March 2001 and August 2004 in a single-consultant, single-centre secondary care clinic serving three primary care trusts, covering a population of approximately 270,000 people.
High-content screening has emerged as a new and powerful technique for identifying small-molecule modulators of mammalian cell biology. The authors describe the development and execution of a high-content screen to identify small molecules that induce mitotic arrest in mammalian cancer cells. Many widely used chemotherapeutics, such as Taxol and vinblastine, induce mitotic arrest, and the creation of new drugs that also induce mitotic arrest may have tremendous therapeutic value.
View Article and Find Full Text PDFAt the stage of optimization of a chemical series the compounds are normally assayed for binding or inhibition on the target protein as well as on several proteins from a selectivity panel. These proteins are normally identified on the basis of sequence homology to the target protein. Experimental selectivity data are also taken into account if available.
View Article and Find Full Text PDFThe K-means method is a popular technique for clustering data into k-partitions. In the adaptive form of the algorithm, Lloyds method, an iterative procedure alternately assigns cluster membership based on a set of centroids and then redefines the centroids based on the computed cluster membership. The most time-consuming part of this algorithm is the determination of which points being clustered belong to which cluster center.
View Article and Find Full Text PDFAs high throughput techniques in chemical synthesis and screening improve, more demands are placed on computer assisted design and virtual screening. Many of these computational methods require one or more three-dimensional conformations for molecules, creating a demand for a conformational analysis tool that can rapidly and robustly cover the low-energy conformational spaces of small molecules. A new algorithm of intersection is presented here, which quickly generates (on average <0.
View Article and Find Full Text PDFWe describe statistical techniques for effective evaluation of large virtual combinatorial libraries (> 10(10) potential compounds). The methods described are used for computationally evaluating templates (prioritization of candidate libraries for synthesis and screening) and for the design of individual combinatorial libraries (e.g.
View Article and Find Full Text PDFJ Chem Inf Comput Sci
August 1996
A new algorithm for identifying three-dimensional configurations of chemical features common to a set of molecules is described. The algorithm scores each configuration based both on the degree to which it is common to the input set and its estimated rarity. The algorithm can be applied to molecules with large (several hundred) conformational models.
View Article and Find Full Text PDFJ Chem Inf Comput Sci
August 1991
The searching and characterization of large chemical databases has recently provoked much interest, particularly with respect to the question of whether any of the compounds in the database could serve as new leads to a compound of pharmacological interest. This paper introduces a fast and novel method of determining whether any of a given series of compounds are able, on geometrical grounds, to interact with an active site of interest. The C program written to implement the method is able to make a qualitative prediction for a given compound in about 1 s per structure (for drug-sized molecules), while still permitting the compound complete conformational freedom.
View Article and Find Full Text PDFJ Chem Inf Comput Sci
August 1988
Distance geometry is a technique widely used to find atomic coordinates that agree with given upper and lower bounds on the interatomic distances. It is successful because it chooses at random some relatively good "trial coordinates" that take into account the whole molecule and all constraints at once. Customarily, these trial coordinates must be refined by minimizing a penalty function until the structure agrees with the original bounds.
View Article and Find Full Text PDF