96 research outputs found
Systematic extraction of structure-activity relationship information from biological screening data
Design of chemical space networks incorporating compound distance relationships
Networks, in which nodes represent compounds and edges pairwise similarity relationships, are used as coordinate-free representations of chemical space. So-called chemical space networks (CSNs) provide intuitive access to structural relationships within compound data sets and can be annotated with activity information. However, in such similarity-based networks, distances between compounds are typically determined for layout purposes and clarity and have no chemical meaning. By contrast, inter-compound distances as a measure of dissimilarity can be directly obtained from coordinate-based representations of chemical space. Herein, we introduce a CSN variant that incorporates compound distance relationships and thus further increases the information content of compound networks. The design was facilitated by adapting the Kamada-Kawai algorithm. Kamada-Kawai networks are the first CSNs that are based on numerical similarity measures, but do not depend on chosen similarity threshold values
Analyzing multitarget activity landscapes using protein-ligand interaction fingerprints: interaction cliffs.
This is the original submitted version, before peer review. The final peer-reviewed version is available from ACS at http://pubs.acs.org/doi/abs/10.1021/ci500721x.Activity landscape modeling is mostly a descriptive technique that allows rationalizing continuous and discontinuous SARs. Nevertheless, the interpretation of some landscape features, especially of activity cliffs, is not straightforward. As the nature of activity cliffs depends on the ligand and the target, information regarding both should be included in the analysis. A specific way to include this information is using protein-ligand interaction fingerprints (IFPs). In this paper we report the activity landscape modeling of 507 ligand-kinase complexes (from the KLIFS database) including IFP, which facilitates the analysis and interpretation of activity cliffs. Here we introduce the structure-activity-interaction similarity (SAIS) maps that incorporate information on ligand-target contact similarity. We also introduce the concept of interaction cliffs defined as ligand-target complexes with high structural and interaction similarity but have a large potency difference of the ligands. Moreover, the information retrieved regarding the specific interaction allowed the identification of activity cliff hot spots, which help to rationalize activity cliffs from the target point of view. In general, the information provided by IFPs provides a structure-based understanding of some activity landscape features. This paper shows examples of analyses that can be carried out when IFPs are added to the activity landscape model.M-L is very
grateful to CONACyT (No. 217442/312933) and the Cambridge Overseas Trust for funding. AB
thanks Unilever for funding and the European Research Council for a Starting Grant (ERC-2013-
StG-336159 MIXTURE). J.L.M-F. is grateful to the School of Chemistry, Department of
Pharmacy of the National Autonomous University of Mexico (UNAM) for support. This work
was supported by a scholarship from the Secretariat of Public Education and the Mexican
government
Insulin Glargine in the Intensive Care Unit: A Model-Based Clinical Trial Design
Online 4 Oct 2012Introduction: Current succesful AGC (Accurate Glycemic Control) protocols require extra clinical effort and are impractical in less acute wards where patients are still susceptible to stress-induced hyperglycemia. Long-acting insulin Glargine has the potential to be used in a low effort controller. However, potential variability in efficacy and length of action, prevent direct in-hospital use in an AGC framework for less acute wards.
Method: Clinically validated virtual trials based on data from stable ICU patients from the SPRINT cohort who would be transferred to such an approach are used to develop a 24-hour AGC protocol robust to different Glargine potencies (1.0x, 1.5x and 2.0x regular insulin) and initial dose sizes (dose = total insulin over prior 12, 18 and 24 hours). Glycemic control in this period is provided only by varying nutritional inputs. Performance is assessed as %BG in the 4.0-8.0mmol/L band and safety by %BG<4.0mmol/L.
Results: The final protocol consisted of Glargine bolus size equal to insulin over the previous 18 hours. Compared to SPRINT there was a 6.9% - 9.5% absolute decrease in mild hypoglycemia (%BG<4.0mmol/L) and up to a 6.2% increase in %BG between 4.0 and 8.0mmol/L. When the efficacy is known (1.5x assumed) there were reductions of: 27% BG measurements, 59% insulin boluses, 67% nutrition changes, and 6.3% absolute in mild hypoglycemia.
Conclusion: A robust 24-48 clinical trial has been designed to safely investigate the efficacy and kinetics of Glargine as a first step towards developing a Glargine-based protocol for less acute wards. Ensuring robustness to variability in Glargine efficacy significantly affects the performance and safety that can be obtained
Quantification and visualization of structure-activity-relationships at multiple levels of detail
Structural Interpretation of Activity Cliffs Revealed by Systematic Analysis of Structure−Activity Relationships in Analog Series
Blocked inverted indices for exact clustering of large chemical spaces
The calculation of pairwise compound similarities based on fingerprints is one of the fundamental tasks in chemoinformatics. Methods for efficient calculation of compound similarities are of utmost importance for various applications like similarity searching or library clustering. With the increasing size of public compound databases, exact clustering of these databases is desirable, but often computationally prohibitively expensive. We present an optimized inverted index algorithm for the calculation of all pairwise similarities on 2D fingerprints of a given dataset. In contrast to other algorithms it does neither require GPU computing, nor does it yield a stochastic approximation of the clustering. The algorithm has been designed to work well with multicore architectures and shows excellent parallel speedup. As an application example of this algorithm we implemented a deterministic clustering application, which has been designed to decompose virtual libraries comprising tens of millions of compounds in a short time on current hardware. Our results show, that our implementation achieves more than 400 million Tanimoto similarity calculations per second on a common desktop CPU. Deterministic clustering of the available chemical space thus can be done on modern multicore machines within a few days
- …