Enzyme classification using complex dynamic hemithioacetal systems.
Ontology highlight
ABSTRACT:
SUBMITTER: Zhang Y
PROVIDER: S-EPMC4820758 | biostudies-literature | 2016 Apr
REPOSITORIES: biostudies-literature
Publications
Enzyme classification using complex dynamic hemithioacetal systems.
Zhang Yan Y Jayawardena H Surangi N HS Yan Mingdi M Ramström Olof O
Chemical communications (Cambridge, England) 20160318 28
A complex dynamic hemithioacetal system was generated for the evaluation of lipase reactivities in organic media. In combination with pattern recognition methodology, twelve different lipases were successfully classified into four distinct groups following their reaction selectivities and reactivities. A probe lipase was further categorized using the training matrix with predicted reactivity. ...[more]
Similar Datasets
Project description:Several fields of study are concerned with uniting the concept of computation with that of the design of physical systems. For example, a recent trend in robotics is to design robots in such a way that they require a minimal control effort. Another example is found in the domain of photonics, where recent efforts try to benefit directly from the complex nonlinear dynamics to achieve more efficient signal processing. The underlying goal of these and similar research efforts is to internalize a large part of the necessary computations within the physical system itself by exploiting its inherent non-linear dynamics. This, however, often requires the optimization of large numbers of system parameters, related to both the system's structure as well as its material properties. In addition, many of these parameters are subject to fabrication variability or to variations through time. In this paper we apply a machine learning algorithm to optimize physical dynamic systems. We show that such algorithms, which are normally applied on abstract computational entities, can be extended to the field of differential equations and used to optimize an associated set of parameters which determine their behavior. We show that machine learning training methodologies are highly useful in designing robust systems, and we provide a set of both simple and complex examples using models of physical dynamical systems. Interestingly, the derived optimization method is intimately related to direct collocation a method known in the field of optimal control. Our work suggests that the application domains of both machine learning and optimal control have a largely unexplored overlapping area which envelopes a novel design methodology of smart and highly complex physical systems.
| S-EPMC3908928 | biostudies-literature
Project description:Time series generated by complex systems like financial markets and the earth's atmosphere often represent superstatistical random walks: on short time scales, the data follow a simple low-level model, but the model parameters are not constant and can fluctuate on longer time scales according to a high-level model. While the low-level model is often dictated by the type of the data, the high-level model, which describes how the parameters change, is unknown in most cases. Here we present a computationally efficient method to infer the time course of the parameter variations from time-series with short-range correlations. Importantly, this method evaluates the model evidence to objectively select between competing high-level models. We apply this method to detect anomalous price movements in financial markets, characterize cancer cell invasiveness, identify historical policies relevant for working safety in coal mines, and compare different climate change scenarios to forecast global warming.
| S-EPMC5935699 | biostudies-literature
Project description:A classification of gluten polymer networks would support a better understanding of structure-function relationships of any gluten polymer material and thus, the control of processing properties. However, quantification and interpretation of the gluten network structures is challenging due to their complexity. Thus, the network formation was altered by specific gluten-modifying agents (glutathione, ascorbic acid, potassium bromate, glucose oxidase, transglutaminase, bromelain) in this study in order to clarify if structural alterations can be detected on a microstructural level and to specify different polymer arrangements in general. Microstructure analysis was performed by confocal laser scanning microscopy followed by quantification with protein network analysis. It was shown that alterations in gluten microstructure could be elucidated according to the kind of modification in cross-linking (disulphide, (iso) peptide, dityrosyl). Linear correlations of structural network attributes among each other were found, leading to an assertion in general: the higher the branching rate, the thinner the protein threads and the larger the interconnected protein aggregate. Considering the morphological attribute lacunarity, a quantitative classification of different gluten arrangements was established. These assertions were extended by using unspecific gluten-modifying agents in addition to the specific ones. Ultimately, five network types were proposed based on diverse polymer arrangements.
| S-EPMC6403851 | biostudies-literature
Project description:As a growing number of protein structures are resolved without known functions, using computational methods to help predict protein functions from the structures becomes more and more important. Some computational methods predict protein functions by aligning to homologous proteins with known functions, but they fail to work if such homology cannot be identified. In this paper we classify enzymes/non-enzymes using non-alignment features. We propose a new ensemble method that includes three support vector machines (SVM) and two k-nearest neighbor algorithms (k-NN) and uses a simple majority voting rule. The test on a data set of 697 enzymes and 480 non-enzymes adapted from Dobson and Doig shows 85.59% accuracy in a 10-fold cross validation and 86.49% accuracy in a leave-one-out validation. The prediction accuracy is much better than other non-alignment features based methods and even slightly better than alignment features based methods. To our knowledge, our method is the first time to use ensemble methods to classify enzymes/non-enzymes and is superior over a single classifier.
| S-EPMC3091888 | biostudies-literature
Project description:Mathematical modeling is seen as a key step to understand, predict, and control the temporal dynamics of interacting systems in such diverse areas like physics, biology, medicine, and economics. However, for large and complex systems we usually have only partial knowledge about the network, the coupling functions, and the interactions with the environment governing the dynamic behavior. This incomplete knowledge induces structural model errors which can in turn be the cause of erroneous model predictions or misguided interpretations. Uncovering the location of such structural model errors in large networks can be a daunting task for a modeler. Here, we present a data driven method to search for structural model errors and to confine their position in large and complex dynamic networks. We introduce a coherence measure for pairs of network nodes, which indicates, how difficult it is to distinguish these nodes as sources of an error. By clustering network nodes into coherence groups and inferring the cluster inputs we can decide, which cluster is affected by an error. We demonstrate the utility of our method for the C. elegans neural network, for a signal transduction model for UV-B light induced morphogenesis and for synthetic examples.
| S-EPMC7830364 | biostudies-literature
Project description:Supramolecular polymers are composed of monomers that self-assemble non-covalently, generating distributions of monodimensional fibres in continuous communication with each other and with the surrounding solution. Fibres, exchanging molecular species, and external environment constitute a sole complex system, which intrinsic dynamics is hard to elucidate. Here we report coarse-grained molecular simulations that allow studying supramolecular polymers at the thermodynamic equilibrium, explicitly showing the complex nature of these systems, which are composed of exquisitely dynamic molecular entities. Detailed studies of molecular exchange provide insights into key factors controlling how assemblies communicate with each other, defining the equilibrium dynamics of the system. Using minimalistic and finer chemically relevant molecular models, we observe that a rich concerted complexity is intrinsic in such self-assembling systems. This offers a new dynamic and probabilistic (rather than structural) picture of supramolecular polymer systems, where the travelling molecular species continuously shape the assemblies that statistically emerge at the equilibrium.
| S-EPMC9021206 | biostudies-literature
Project description:Classification methods of DNA most commonly use comparison of the differences in DNA symbolic records, which requires the global multiple sequence alignment. This solution is often inappropriate, causing a number of imprecisions and requires additional user intervention for exact alignment of the similar segments. The similar segments in DNA represented as a signal are characterized by a similar shape of the curve. The DNA alignment in genomic signals may adjust whole sections not only individual symbols. The dynamic time warping (DTW) is suitable for this purpose and can replace the multiple alignment of symbolic sequences in applications, such as phylogenetic analysis.The proposed method is composed of three main parts. The first part represent conversion of symbolic representation of DNA sequences in the form of a string of A,C,G,T symbols to signal representation in the form of cumulated phase of complex components defined for each symbol. Next part represents signals size adjustment realized by standard signal preprocessing methods: median filtration, detrendization and resampling. The final part necessary for genomic signals comparison is position and length alignment of genomic signals by dynamic time warping (DTW).The application of the DTW on set of genomic signals was evaluated in dendrogram construction using cluster analysis. The resulting tree was compared with a classical phylogenetic tree reconstructed using multiple alignment. The classification of genomic signals using the DTW is evolutionary closer to phylogeny of organisms. This method is more resistant to errors in the sequences and less dependent on the number of input sequences.Classification of genomic signals using dynamic time warping is an adequate variant to phylogenetic analysis using the symbolic DNA sequences alignment; in addition, it is robust, quick and more precise technique.
| S-EPMC3750471 | biostudies-literature
Project description:The behaviors of many complex systems, from nanostructured materials to animal colonies, are governed by local events/rearrangements that, while involving a restricted number of interacting units, may generate collective cascade phenomena. Tracking such local events and understanding their emergence and propagation in the system is often challenging. Common strategies consist, for example, in monitoring over time parameters (descriptors) that are designed ad hoc to analyze certain systems. However, such approaches typically require prior knowledge of the system's physics and are poorly transferable. Here, we present a general, transferable, and agnostic analysis approach that can reveal precious information on the physics of a variety of complex dynamical systems starting solely from the trajectories of their constitutive units. Built on a bivariate combination of two abstract descriptors, Local Environments and Neighbors Shuffling and TimeSmooth Overlap of Atomic Position, such approach allows to (i) detect the emergence of local fluctuations in simulation or experimentally acquired trajectories of multibody dynamical systems, (ii) classify fluctuations into categories, and (iii) correlate them in space and time. We demonstrate how this method, based on the abstract concepts of local fluctuations and their spatiotemporal correlations, may reveal precious insights on the emergence and propagation of local and collective phenomena in a variety of complex systems ranging from the atomic- to the macroscopic-scale. This provides a general data-driven approach that we expect will be particularly helpful to study and understand the behavior of systems whose physics is unknown a priori, as well as to revisit a variety of physical phenomena under a new perspective.
| S-EPMC11833705 | biostudies-literature
Project description:As experimental efforts are costly and time consuming, computational characterization of enzyme capabilities is an attractive alternative. We present and evaluate several machine-learning models to predict which of 983 distinct enzymes, as defined via the Enzyme Commission (EC) numbers, are likely to interact with a given query molecule. Our data consists of enzyme-substrate interactions from the BRENDA database. Some interactions are attributed to natural selection and involve the enzyme's natural substrates. The majority of the interactions however involve non-natural substrates, thus reflecting promiscuous enzymatic activities. We frame this "enzyme promiscuity prediction" problem as a multi-label classification task. We maximally utilize inhibitor and unlabelled data to train prediction models that can take advantage of known hierarchical relationships between enzyme classes. We report that a hierarchical multi-label neural network, EPP-HMCNF, is the best model for solving this problem, outperforming k-nearest neighbours similarity-based and other machine learning models. We show that inhibitor information during training consistently improves predictive power, particularly for EPP-HMCNF. We also show that all promiscuity prediction models perform worse under a realistic data split when compared to a random data split, and when evaluating performance on non-natural substrates compared to natural substrates. We provide Python code for EPP-HMCNF and other models in a repository termed EPP (Enzyme Promiscuity Prediction) at https://github.com/hassounlab/EPP. Supplementary data are available at Bioinformatics online.
| S-EPMC8337005 | biostudies-literature
Project description:Recently developed methods of longitudinal discriminant analysis allow for classification of subjects into prespecified prognostic groups using longitudinal history of both continuous and discrete biomarkers. The classification uses Bayesian estimates of the group membership probabilities for each prognostic group. These estimates are derived from a multivariate generalised linear mixed model of the biomarker's longitudinal evolution in each of the groups and can be updated each time new data is available for a patient, providing a dynamic (over time) allocation scheme. However, the precision of the estimated group probabilities differs for each patient and also over time. This precision can be assessed by looking at credible intervals for the group membership probabilities. In this paper, we propose a new allocation rule that incorporates credible intervals for use in context of a dynamic longitudinal discriminant analysis and show that this can decrease the number of false positives in a prognostic test, improving the positive predictive value. We also establish that by leaving some patients unclassified for a certain period, the classification accuracy of those patients who are classified can be improved, giving increased confidence to clinicians in their decision making. Finally, we show that determining a stopping rule dynamically can be more accurate than specifying a set time point at which to decide on a patient's status. We illustrate our methodology using data from patients with epilepsy and show how patients who fail to achieve adequate seizure control are more accurately identified using credible intervals compared to existing methods.
| S-EPMC5655752 | biostudies-literature