Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

In Search of the Optimal Macrocyclization Site for Neurotensin.

ABSTRACT: Neurotensin exerts potent analgesic effects following activation of its cognate GPCRs. In this study, we describe a systematic exploration, using structure-based design, of conformationally constraining neurotensin (8-13) with the help of macrocyclization and the resulting impacts on binding affinity, signaling, and proteolytic stability. This exploratory study led to a macrocyclic scaffold with submicromolar binding affinity, agonist activity, and greatly improved plasma stability.

SUBMITTER: Sousbie M

PROVIDER: S-EPMC5846049 | biostudies-literature | 2018 Mar

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

In Search of the Optimal Macrocyclization Site for Neurotensin.

Sousbie Marc M Besserer-Offroy Élie É Brouillette Rebecca L RL Longpré Jean-Michel JM Leduc Richard R Sarret Philippe P Marsault Éric É

ACS medicinal chemistry letters 20180129 3

Neurotensin exerts potent analgesic effects following activation of its cognate GPCRs. In this study, we describe a systematic exploration, using structure-based design, of conformationally constraining neurotensin (8-13) with the help of macrocyclization and the resulting impacts on binding affinity, signaling, and proteolytic stability. This exploratory study led to a macrocyclic scaffold with submicromolar binding affinity, agonist activity, and greatly improved plasma stability. ...[more]

PMID: 29541365

Similar Datasets

Optimal settings of mass spectrometry open search strategy for higher confidence

Project description:More than half of the mass spectra could not be identified in most proteome mass spectrometry experiments. Various modifications have been considered as a major reason. Open search strategy was then introduced to solve this problem, however, lacking thorough quality assessment using independent information. Here, we used the “Suspicious Discovery Rate (SDR)” based on the translatome sequencing (RNC-seq) as an independent source to assess the proteome open search strategy. We found that the open search strategy increased the spectra utilization with the cost of increasing suspicious identifications that lacks translation evidence. We further suggested that restricting the peptide FDR below 0.1% would efficiently control the suspicious identifications of open search methods and enhanced the confidence of the peptide identification with modifications than the narrow window search. These results facilitated the proper use of open search methods for higher quality of proteome identifications with the information of post-translational modifications and single amino acid polymorphisms

2018-10-04 | GSE112623 | GEO

Optimal random search using limited spatial memory.

Project description:Lévy walks are known to be efficient movements because Lévy walkers search wide areas while restricting returns to previously visited sites. A self-avoiding walk (SAW) is a series of moves on a lattice that visit the same place only once. As such, SAWs can also be effective search algorithms. However, it is not realistic that foragers memorize many visited positions for a long time. In this work, we investigated whether foragers performed optimal searches when having limited memory. The agent in our model followed SAWs to some extent by memorizing and avoiding visited places. However, the agent lost its memory after a while. In that situation, the agent changed its reactions to visited patches by considering global trail patterns based on local memorized information. As a result, we succeeded in making the agent occasionally produce ballistic walks related to power-law tailed movements across some ranges.

| S-EPMC5882669 | biostudies-literature

Optimal search strategies on complex multi-linked networks.

Project description:In this paper we consider the problem of optimal search strategies on multi-linked networks, i.e. graphs whose nodes are endowed with several independent sets of links. We focus preliminarily on agents randomly hopping along the links of a graph, with the additional possibility of performing non-local hops to randomly chosen nodes with a given probability. We show that an optimal combination of the two jump rules exists that maximises the efficiency of target search, the optimum reflecting the topology of the network. We then generalize our results to multi-linked networks with an arbitrary number of mutually interfering link sets.

| S-EPMC4423499 | biostudies-literature

Robotic search for optimal cell culture in regenerative medicine.

Project description:Induced differentiation is one of the most experience- and skill-dependent experimental processes in regenerative medicine, and establishing optimal conditions often takes years. We developed a robotic AI system with a batch Bayesian optimization algorithm that autonomously induces the differentiation of induced pluripotent stem cell-derived retinal pigment epithelial (iPSC-RPE) cells. From 200 million possible parameter combinations, the system performed cell culture in 143 different conditions in 111 days, resulting in 88% better iPSC-RPE production than that obtained by the pre-optimized culture in terms of the pigmentation scores. Our work demonstrates that the use of autonomous robotic AI systems drastically accelerates systematic and unbiased exploration of experimental search space, suggesting immense use in medicine and research.

| S-EPMC9239686 | biostudies-literature

Behavior and neural basis of near-optimal visual search.

Project description:The ability to search efficiently for a target in a cluttered environment is one of the most remarkable functions of the nervous system. This task is difficult under natural circumstances, as the reliability of sensory information can vary greatly across space and time and is typically a priori unknown to the observer. In contrast, visual-search experiments commonly use stimuli of equal and known reliability. In a target detection task, we randomly assigned high or low reliability to each item on a trial-by-trial basis. An optimal observer would weight the observations by their trial-to-trial reliability and combine them using a specific nonlinear integration rule. We found that humans were near-optimal, regardless of whether distractors were homogeneous or heterogeneous and whether reliability was manipulated through contrast or shape. We present a neural-network implementation of near-optimal visual search based on probabilistic population coding. The network matched human performance.

| S-EPMC3713779 | biostudies-literature

A Single Active Site Mutation in the Pikromycin Thioesterase Generates a More Effective Macrocyclization Catalyst.

Project description:Macrolactonization of natural product analogs presents a significant challenge to both biosynthetic assembly and synthetic chemistry. In the preceding paper , we identified a thioesterase (TE) domain catalytic bottleneck processing unnatural substrates in the pikromycin (Pik) system, preventing the formation of epimerized macrolactones. Here, we perform molecular dynamics simulations showing the epimerized hexaketide was accommodated within the Pik TE active site; however, intrinsic conformational preferences of the substrate resulted in predominately unproductive conformations, in agreement with the observed hydrolysis. Accordingly, we engineered the stereoselective Pik TE to yield a variant (TES148C) with improved reaction kinetics and gain-of-function processing of an unnatural, epimerized hexaketide. Quantum mechanical comparison of model TES148C and TEWT reaction coordinate diagrams revealed a change in mechanism from a stepwise addition-elimination (TEWT) to a lower energy concerted acyl substitution (TES148C), accounting for the gain-of-function and improved reaction kinetics. Finally, we introduced the S148C mutation into a polyketide synthase module (PikAIII-TE) to impart increased substrate flexibility, enabling the production of diastereomeric macrolactones.

| S-EPMC5617804 | biostudies-literature

Neurotensin

Project description: Not available

| S-EPMC2884632 | biostudies-literature

Metric learning for enzyme active-site search.

Project description:MotivationFinding functionally analogous enzymes based on the local structures of active sites is an important problem. Conventional methods use templates of local structures to search for analogous sites, but their performance depends on the selection of atoms for inclusion in the templates.ResultsThe automatic selection of atoms so that site matches can be discriminated from mismatches. The algorithm provides not only good predictions, but also some insights into which atoms are important for the prediction. Our experimental results suggest that the metric learning automatically provides more effective templates than those whose atoms are selected manually.AvailabilityOnline software is available at http://www.net-machine.net/?kato/lpmetric1/

| S-EPMC2958746 | biostudies-literature

A novel adaptive Cuckoo search for optimal query plan generation.

Project description:The emergence of multiple web pages day by day leads to the development of the semantic web technology. A World Wide Web Consortium (W3C) standard for storing semantic web data is the resource description framework (RDF). To enhance the efficiency in the execution time for querying large RDF graphs, the evolving metaheuristic algorithms become an alternate to the traditional query optimization methods. This paper focuses on the problem of query optimization of semantic web data. An efficient algorithm called adaptive Cuckoo search (ACS) for querying and generating optimal query plan for large RDF graphs is designed in this research. Experiments were conducted on different datasets with varying number of predicates. The experimental results have exposed that the proposed approach has provided significant results in terms of query execution time. The extent to which the algorithm is efficient is tested and the results are documented.

| S-EPMC4158119 | biostudies-other

Pareto Optimal Projection Search (POPS): Automated Radiation Therapy Treatment Planning by Direct Search of the Pareto Surface.

Project description:ObjectiveRadiation therapy treatment planning is a time-consuming, iterative process with potentially high inter-planner variability. Fully automated treatment planning processes could reduce a planner's active treatment planning time and remove inter-planner variability, with the potential to tremendously improve patient turnover and quality of care. In developing fully automated algorithms for treatment planning, we have two main objectives: to produce plans that are 1) Pareto optimal and 2) clinically acceptable. Here, we propose the Pareto optimal projection search (POPS) algorithm, which provides a general framework for directly searching the Pareto front.MethodsOur POPS algorithm is a novel automated planning method that combines two main search processes: 1) gradient-free search in the decision variable space and 2) projection of decision variables to the Pareto front using the bisection method. We demonstrate the performance of POPS by comparing with clinical treatment plans. As one possible quantitative measure of treatment plan quality, we construct a clinical acceptability scoring function (SF) modified from the previously developed general evaluation metric (GEM).ResultsOn a dataset of 21 prostate cases collected as part of clinical workflow, our proposed POPS algorithm produces Pareto optimal plans that are clinically acceptable in regards to dose conformity, dose homogeneity, and sparing of organs-at-risk.ConclusionOur proposed POPS algorithm provides a general framework for fully automated treatment planning that achieves clinically acceptable dosimetric quality without requiring active planning from human planners.SignificanceOur fully automated POPS algorithm addresses many key limitations of other automated planning approaches, and we anticipate that it will substantially improve treatment planning workflow.

| S-EPMC8526351 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data