Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

A retrosynthetic analysis algorithm implementation.

ABSTRACT: The need for synthetic route design arises frequently in discovery-oriented chemistry organizations. While traditionally finding solutions to this problem has been the domain of human experts, several computational approaches, aided by the algorithmic advances and the availability of large reaction collections, have recently been reported. Herein we present our own implementation of a retrosynthetic analysis method and demonstrate its capabilities in an attempt to identify synthetic routes for a collection of approved drugs. Our results indicate that the method, leveraging on reaction transformation rules learned from a large patent reaction dataset, can identify multiple theoretically feasible synthetic routes and, thus, support research chemist everyday efforts.

SUBMITTER: Watson IA

PROVIDER: S-EPMC6689887 | biostudies-other | 2019 Jan

REPOSITORIES: biostudies-other

ACCESS DATA

Json Xml

Publications

A retrosynthetic analysis algorithm implementation.

Watson Ian A IA Wang Jibo J Nicolaou Christos A CA

Journal of cheminformatics 20190103 1

The need for synthetic route design arises frequently in discovery-oriented chemistry organizations. While traditionally finding solutions to this problem has been the domain of human experts, several computational approaches, aided by the algorithmic advances and the availability of large reaction collections, have recently been reported. Herein we present our own implementation of a retrosynthetic analysis method and demonstrate its capabilities in an attempt to identify synthetic routes for a ...[more]

PMID: 30604073

Similar Datasets

Simplified algorithm for reliability sensitivity analysis of structures: A spreadsheet implementation.

Project description:An important segment of the reliability-based optimization problems is to get access to the sensitivity derivatives. However, since the failure probability is not a closed-form function of the input variables, the derivatives are not explicitly computable and rather require a full reliability analysis which is computationally expensive. In this paper, a step-by-step algorithm has been presented to calculate the derivatives of the probability of failure and safety index with respect to the input parameters based on the advanced first-order second-moment (AFOSM) reliability method. The proposed algorithm is then implemented in a spreadsheet using Visual Basic for Application (VBA) programming language. Two geotechnical and structural examples are then presented to examine the program and describe the modeling procedure. The robustness of the proposed method is examined using a Gaussian random perturbation. The capability of the proposed method in the calculation of the sensitivity derivatives of the model uncertainty is explained in a separate section. Finally, the proposed model has been compared to the forward finite difference (FFD) method and the results are validated.

| S-EPMC6407918 | biostudies-literature

Clinical implementation of a neonatal seizure detection algorithm.

Project description:Technologies for automated detection of neonatal seizures are gradually moving towards cot-side implementation. The aim of this paper is to present different ways to visualize the output of a neonatal seizure detection system and analyse their influence on performance in a clinical environment. Three different ways to visualize the detector output are considered: a binary output, a probabilistic trace, and a spatio-temporal colormap of seizure observability. As an alternative to visual aids, audified neonatal EEG is also considered. Additionally, a survey on the usefulness and accuracy of the presented methods has been performed among clinical personnel. The main advantages and disadvantages of the presented methods are discussed. The connection between information visualization and different methods to compute conventional metrics is established. The results of the visualization methods along with the system validation results indicate that the developed neonatal seizure detector with its current level of performance would unambiguously be of benefit to clinicians as a decision support system. The results of the survey suggest that a suitable way to visualize the output of neonatal seizure detection systems in a clinical environment is a combination of a binary output and a probabilistic trace. The main healthcare benefits of the tool are outlined. The decision support system with the chosen visualization interface is currently undergoing pre-market European multi-centre clinical investigation to support its regulatory approval and clinical adoption.

| S-EPMC4394138 | biostudies-literature

Weighted Implementation of Suboptimal Paths (WISP): An Optimized Algorithm and Tool for Dynamical Network Analysis.

Project description:Allostery can occur by way of subtle cooperation among protein residues (e.g., amino acids) even in the absence of large conformational shifts. Dynamical network analysis has been used to model this cooperation, helping to computationally explain how binding to an allosteric site can impact the behavior of a primary site many ångstroms away. Traditionally, computational efforts have focused on the most optimal path of correlated motions leading from the allosteric to the primary active site. We present a program called Weighted Implementation of Suboptimal Paths (WISP) capable of rapidly identifying additional suboptimal pathways that may also play important roles in the transmission of allosteric signals. Aside from providing signal redundancy, suboptimal paths traverse residues that, if disrupted through pharmacological or mutational means, could modulate the allosteric regulation of important drug targets. To demonstrate the utility of our program, we present a case study describing the allostery of HisH-HisF, an amidotransferase from T. maritima thermotiga. WISP and its VMD-based graphical user interface (GUI) can be downloaded from http://nbcr.ucsd.edu/wisp.

| S-EPMC3958135 | biostudies-literature

GPU Implementation of the Improved CEEMDAN Algorithm for Fast and Efficient EEG Time-Frequency Analysis.

Project description:Time-frequency analysis of EEG data is a key step in exploring the internal activities of the human brain. Studying oscillations is an important part of the analysis, as they are thought to provide the underlying mechanism for communication between neural assemblies. Traditional methods of analysis, such as Short-Time FFT and Wavelet Transforms, are not ideal for this task due to the time-frequency uncertainty principle and their reliance on predefined basis functions. Empirical Mode Decomposition and its variants are more suited to this task as they are able to extract the instantaneous frequency and phase information but are too time consuming for practical use. Our aim was to design and develop a massively parallel and performance-optimized GPU implementation of the Improved Complete Ensemble EMD with the Adaptive Noise (CEEMDAN) algorithm that significantly reduces the computational time (from hours to seconds) of such analysis. The resulting GPU program, which is publicly available, was validated against a MATLAB reference implementation and reached over a 260× speedup for actual EEG measurement data, and provided predicted speedups in the range of 3000-8300× for longer measurements when sufficient memory was available. The significance of our research is that this implementation can enable researchers to perform EMD-based EEG analysis routinely, even for high-density EEG measurements. The program is suitable for execution on desktop, cloud, and supercomputer systems and can be the starting point for future large-scale multi-GPU implementations.

| S-EPMC10611056 | biostudies-literature

A Verified Implementation of the Berlekamp-Zassenhaus Factorization Algorithm.

Project description:We formally verify the Berlekamp-Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt an existing formalization of Yun's square-free factorization algorithm to integer polynomials, and thus provide an efficient and certified factorization algorithm for arbitrary univariate polynomials. The algorithm first performs factorization in the prime field GF(p) and then performs computations in the ring of integers modulo pk , where both p and k are determined at runtime. Since a natural modeling of these structures via dependent types is not possible in Isabelle/HOL, we formalize the whole algorithm using locales and local type definitions. Through experiments we verify that our algorithm factors polynomials of degree up to 500 within seconds.

| S-EPMC7115093 | biostudies-literature

All-Optical Implementation of the Ant Colony Optimization Algorithm.

Project description:We report all-optical implementation of the optimization algorithm for the famous "ant colony" problem. Ant colonies progressively optimize pathway to food discovered by one of the ants through identifying the discovered route with volatile chemicals (pheromones) secreted on the way back from the food deposit. Mathematically this is an important example of graph optimization problem with dynamically changing parameters. Using an optical network with nonlinear waveguides to represent the graph and a feedback loop, we experimentally show that photons traveling through the network behave like ants that dynamically modify the environment to find the shortest pathway to any chosen point in the graph. This proof-of-principle demonstration illustrates how transient nonlinearity in the optical system can be exploited to tackle complex optimization problems directly, on the hardware level, which may be used for self-routing of optical signals in transparent communication networks and energy flow in photonic systems.

| S-EPMC4879568 | biostudies-literature

A wheeze recognition algorithm for practical implementation in children.

Project description:BackgroundThe detection of wheezes as an exacerbation sign is important in certain respiratory diseases. However, few highly accurate clinical methods are available for automatic detection of wheezes in children. This study aimed to develop a wheeze detection algorithm for practical implementation in children.MethodsA wheeze recognition algorithm was developed based on wheezes features following the Computerized Respiratory Sound Analysis guidelines. Wheezes can be detected by auscultation with a stethoscope and using an automatic computerized lung sound analysis. Lung sounds were recorded for 30 s in 214 children aged 2 months to 12 years and 11 months in a pediatric consultation room. Files containing recorded lung sounds were assessed by two specialist physicians and divided into two groups: 65 were designated as "wheeze" files, and 149 were designated as "no-wheeze" files. All lung sound judgments were agreed between two specialist physicians. We compared wheeze recognition between the specialist physicians and using the wheeze recognition algorithm and calculated the sensitivity, specificity, positive predictive value, and negative predictive value for all recorded sound files to evaluate the influence of age on the wheeze detection sensitivity.ResultsThe detection of wheezes was not influenced by age. In all files, wheezes were differentiated from noise using the wheeze recognition algorithm. The sensitivity, specificity, positive predictive value, and negative predictive value of the wheeze recognition algorithm were 100%, 95.7%, 90.3%, and 100%, respectively.ConclusionsThe wheeze recognition algorithm could identify wheezes in sound files and therefore may be useful in the practical implementation of respiratory illness management at home using properly developed devices.

| S-EPMC7544038 | biostudies-literature

RhierBAPS: An R implementation of the population clustering algorithm hierBAPS.

Project description:Identifying structure in collections of sequence data sets remains a common problem in genomics. hierBAPS, a popular algorithm for identifying population structure in haploid genomes, has previously only been available as a MATLAB binary. We provide an R implementation which is both easier to install and use, automating the entire pipeline. Additionally, we allow for the use of multiple processors, improve on the default settings of the algorithm, and provide an interface with the ggtree library to enable informative illustration of the clustering results. Our aim is that this package aids in the understanding and dissemination of the method, as well as enhancing the reproducibility of population structure analyses.

| S-EPMC6178908 | biostudies-other

Screening Veterans for Syphilis: Implementation of the Reverse Sequence Algorithm.

Project description:We evaluated the syphilis reverse sequence algorithm (RSA) in a Veteran Affairs facility, finding 5.5% reactive Treponema pallidum enzyme immunoassay (EIA) tests. In a subset of EIA+/VDRL-/TP-PA+ cases, 48% were previously treated. Of veterans with unknown/no prior therapy, only 45% had documentation of subsequent treatment, suggesting suboptimal interpretation of RSA results.

| S-EPMC5850439 | biostudies-literature

Decoding the brain's algorithm for categorization from its neural implementation.

Project description:Acts of cognition can be described at different levels of analysis: what behavior should characterize the act, what algorithms and representations underlie the behavior, and how the algorithms are physically realized in neural activity [1]. Theories that bridge levels of analysis offer more complete explanations by leveraging the constraints present at each level [2-4]. Despite the great potential for theoretical advances, few studies of cognition bridge levels of analysis. For example, formal cognitive models of category decisions accurately predict human decision making [5, 6], but whether model algorithms and representations supporting category decisions are consistent with underlying neural implementation remains unknown. This uncertainty is largely due to the hurdle of forging links between theory and brain [7-9]. Here, we tackle this critical problem by using brain response to characterize the nature of mental computations that support category decisions to evaluate two dominant, and opposing, models of categorization. We found that brain states during category decisions were significantly more consistent with latent model representations from exemplar [5] rather than prototype theory [10, 11]. Representations of individual experiences, not the abstraction of experiences, are critical for category decision making. Holding models accountable for behavior and neural implementation provides a means for advancing more complete descriptions of the algorithms of cognition.

| S-EPMC3874407 | 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