A Grammar Inference Approach for Predicting Kinase Specific Phosphorylation Sites

Abstract

Kinase mediated phosphorylation site detection is the key mechanism of post translational mechanism that plays an important role in regulating various cellular processes and phenotypes. Many diseases, like cancer are related with the signaling defects which are associated with protein phosphorylation. Characterizing the protein kinases and their substrates enhances our ability to understand the mechanism of protein phosphorylation and extends our knowledge of signaling network; thereby helping us to treat such diseases. Experimental methods for predicting phosphorylation sites are labour intensive and expensive. Also, manifold increase of protein sequences in the databanks over the years necessitates the improvement of high speed and accurate computational methods for predicting phosphorylation sites in protein sequences. Till date, a number of computational methods have been proposed by various researchers in predicting phosphorylation sites, but there remains much scope of improvement. In this communication, we present a simple and novel method based on Grammatical Inference (GI) approach to automate the prediction of kinase specific phosphorylation sites. In this regard, we have used a popular GI algorithm Alergia to infer Deterministic Stochastic Finite State Automata (DSFA) which equally represents the regular grammar corresponding to the phosphorylation sites. Extensive experiments on several datasets generated by us reveal that, our inferred grammar successfully predicts phosphorylation sites in a kinase specific manner. It performs significantly better when compared with the other existing phosphorylation site prediction methods. We have also compared our inferred DSFA with two other GI inference algorithms. The DSFA generated by our method performs superior which indicates that our method is robust and has a potential for predicting the phosphorylation sites in a kinase specific manner.

A machine learning approach for predicting methionine oxidation sites

“…In view of this, it is highly desirable to develop in silico methods aimed to predict methionine oxidation sites. Indeed, in the field of protein phosphorylation, the prediction of phosphorylation sites using computational tools has attracted considerable research attention [ 18 – 20 ]. Unfortunately, computational approaches to predict methionine oxidation sites have garnered much less attention, and only very recently some efforts have been devoted to this purpose [ 21 ].…”

Enabling scalability-sensitive speculative parallelization for FSM computations

“…In specific, the speedup S is defined as a non-linear function of the number of cores employed n, along with other parameters, such as the properties of FSM computations FSM.properties and the architecture properties Arch.properties 4 . Depending on if Arch.properties is considered, the models fall into two types:…”

“…As a classic computation model, FSMs have been widely used in many critical applications, such as intrusion detection [16,36], data decoding [14,34], genome and protein motif searching [4,33], and high-performance web analytics [24]. For its fundamental role in many performance-critical applications, it is anticipated that emerging architectures will feature hardware supports for FSM computations, such as automata processor [6].…”

“…This is commonly referred to as strong scaling 4. Note that some architecture properties, such as resource contention, also depend on the number of cores used n.…”

Formal Language Model for Transcriptome and Proteome Data Integration

“…We seek the simplicity necessary to provide an immediate computational implementation, without however making it an ad hoc solution. We are inspired by a series of existing approaches that deal with the modeling of genetic processes [ 1 ], such as the - calculus and the work of Searls [ 7 , 19 ]. In our model, we will present the biological substrate of the relationship between transcriptomes and the proteomes from the point of view of language processing [ 9 ].…”