60 research outputs found

    Conformation and dynamics of human urotensin II and urotensin related peptide in aqueous solution

    Get PDF
    Conformation and dynamics of the vasoconstrictive peptides human urotensin II (UII) and urotensin related peptide (URP) have been investigated by both unrestrained and enhanced-sampling molecular-dynamics (MD) simulations and NMR spectroscopy. These peptides are natural ligands of the G-protein coupled urotensin II receptor (UTR) and have been linked to mammalian pathophysiology. UII and URP cannot be characterized by a single structure but exist as an equilibrium of two main classes of ring conformations, <i>open</i> and <i>folded</i>, with rapidly interchanging subtypes. The <i>open</i> states are characterized by turns of various types centered at K<sup>8</sup>Y<sup>9</sup> or F<sup>6</sup>W<sup>7</sup> predominantly with no or only sparsely populated transannular hydrogen bonds. The <i>folded</i> conformations show multiple turns stabilized by highly populated transannular hydrogen bonds comprising centers F<sup>6</sup>W<sup>7</sup>K<sup>8</sup> or W<sup>7</sup>K<sup>8</sup>Y<sup>9</sup>. Some of these conformations have not been characterized previously. The equilibrium populations that are experimentally difficult to access were estimated by replica-exchange MD simulations and validated by comparison of experimental NMR data with chemical shifts calculated with density-functional theory. UII exhibits approximately 72% <i>open</i>:28% <i>folded</i> conformations in aqueous solution. URP shows very similar ring conformations as UII but differs in an <i>open:folded</i> equilibrium shifted further toward <i>open</i> conformations (86:14) possibly arising from the absence of folded N-terminal tail-ring interaction. The results suggest that the different biological effects of UII and URP are not caused by differences in ring conformations but rather by different interactions with UTR

    Automated detection of structural alerts (chemical fragments) in (eco)toxicology

    No full text
    This mini-review describes the evolution of different algorithms dedicated to the automated discovery of chemical fragments associated to (eco)toxicological endpoints. These structural alerts correspond to one of the most interesting approach of in silico toxicology due to their direct link with specific toxicological mechanisms. A number of expert systems are already available but, since the first work in this field which considered a binomial distribution of chemical fragments between two datasets, new data miners were developed and applied with success in chemoinformatics. The frequency of a chemical fragment in a dataset is often at the core of the process for the definition of its toxicological relevance. However, recent progresses in data mining provide new insights into the automated discovery of new rules. Particularly, this review highlights the notion of Emerging Patterns that can capture contrasts between classes of data

    Automated detection of structural alerts (chemical fragments) in (eco)toxicology

    Get PDF
    International audienceThis mini-review describes the evolution of different algorithms dedicated to the automated discovery of chemical fragments associated to (eco)toxicological endpoints. These structural alerts correspond to one of the most interesting approach of in silico toxicology due to their direct link with specific toxicological mechanisms. A number of expert systems are already available but, since the first work in this field which considered a binomial distribution of chemical fragments between two datasets, new data miners were developed and applied with success in chemoinformatics. The frequency of a chemical fragment in a dataset is often at the core of the process for the definition of its toxicological relevance. However, recent progresses in data mining provide new insights into the automated discovery of new rules. Particularly, this review highlights the notion of Emerging Patterns that can capture contrasts between classes of data

    The Pharmacophore Network: A Computational Method for Exploring Structure–Activity Relationships from a Large Chemical Data Set

    No full text
    International audienceHistorically, structure-activity relationship (SAR) analysis has focused on small sets of molecules, but in recent years, there has been increasing efforts to analyze the growing amount of data stored in public databases like ChEMBL. The pharmacophore network introduced herein is dedicated to the organization of a set of pharmacophores automatically discovered from a large data set of molecules. The network navigation allows to derive essential tasks of a drug discovery process, including the study of the relations between different chemical series, the analysis of the influence of additional chemical features on the compounds' activity, and the identification of diverse binding modes. This paper describes the method used to construct the pharmacophore network, and a case study dealing with BCR-ABL exemplifies its usage for large-scale SAR analysis. Thanks to a benchmarking study, we also demonstrate that the selection of a subset of representative pharmacophores can be used to conduct classification task

    Mining (Soft-)Skypatterns using Constraint Programming

    No full text
    International audienceWithin the pattern mining area, skypatterns enable to express a userpreference point of view according to a dominance relation. In this paper, we deal with the introduction of softness in the skypattern mining problem. First, we show how softness can provide convenient patterns that would be missed otherwise. Then, thanks to Constraint Programming, we propose a generic and efficient method to mine skypatterns as well as soft ones. Finally, we show the relevance and the effectiveness of our approach through a case study in chemoinformatics

    Mining (Soft-) Skypatterns using Dynamic CSP

    No full text
    International audienceWithin the pattern mining area, skypatterns enable to express a userpreference point of view according to a dominance relation. In this paper, we deal with the introduction of softness in the skypattern mining problem. First, we show how softness can provide convenient patterns that would be missed otherwise. Then, thanks to Constraint Programming, we propose a generic and efficient method to mine skypatterns as well as soft ones. Finally, we show the relevance and the effectiveness of our approach through a case study in chemoinformatics

    Soft Constraints for Pattern Mining

    No full text
    International audienceConstraint-based pattern discovery is at the core of numerous data mining tasks. Patterns are extracted with respect to a given set of constraints (frequency, closedness, size, etc). In practice, many constraints require threshold values whose choice is often arbitrary. This difficulty is even harder when several thresholds are required and have to be combined.Moreover, patterns barelymissing a threshold will not be extracted even if they may be relevant. The paper advocates the introduction of softness into the pattern discovery process. By using Constraint Programming, we propose efficient methods to relax threshold constraints as well as constraints involved in patterns such as the top-k patterns and the skypatterns. We show the relevance and the efficiency of our approach through a case study in chemoinformatics for discovering toxicophores
    • …
    corecore