Pattern analysis for the prediction of fungal pro-peptide cleavage sites

Ozogur-Akyuz, S.
Shawe-Taylor, J.
Weber, Gerhard Wilhelm
Ögel, Zümrüt Begüm
Support vector machines (SVMs) have many applications in investigating biological data from gene expression arrays to understanding EEG signals of sleep stages. In this paper, we have developed an application that will support the prediction of the pro-peptide cleavage site of fungal extracellular proteins which display mostly a monobasic or dibasic processing site. Many of the secretory proteins and peptides are synthesized as inactive precursors and they become active after post-translational processing. A collection of fungal proprotein sequences are used as a training data set. A specifically designed kernel is expressed as an application of the well-known Gaussian kernel via feature spaces defined for our problem. Rather than fixing the kernel parameters with cross validation or other methods, we introduce a novel approach that simultaneously performs model selection together with the test of accuracy and testing confidence levels. This leads us to higher accuracy at significantly reduced training times. The results of the server ProP1.0 which predicts pro-peptide cleavage sites are compared with the results of this study. A similar mathematical approach may be adapted to pro-peptide cleavage prediction in other eukaryotes.


Integration of topological measures for eliminating non-specific interactions in protein interaction networks
BAYIR, Murat Ali; GUNEY, Tacettin Dogacan; Can, Tolga (Elsevier BV, 2009-05-28)
High-throughput protein interaction assays aim to provide a comprehensive list of interactions that govern the biological processes in a cell. These large-scale sets of interactions, represented as protein-protein interaction networks, are often analyzed by computational methods for detailed biological interpretation. However, as a result of the tradeoff between speed and accuracy, the interactions reported by high-throughput techniques occasionally include non-specific (i.e., false-positive) interactions. ...
Exponential stability of periodic solutions of recurrent neural networks with functional dependence on piecewise constant argument
Akhmet, Marat; Cengiz, Nur (The Scientific and Technological Research Council of Turkey, 2018-01-01)
In this study, we develop a model of recurrent neural networks with functional dependence on piecewise constant argument of generalized type. Using the theoretical results obtained for functional differential equations with piecewise constant argument, we investigate conditions for existence and uniqueness of solutions, bounded solutions, and exponential stability of periodic solutions. We provide conditions based on the parameters of the model.
Image segmentation and smoothing via partial differential equations
Özmen, Neslihan; Leblebicioğlu, Mehmet Kemal; Department of Scientific Computing (2009)
In image processing, partial differential equation (PDE) based approaches have been extensively used in segmentation and smoothing applications. The Perona-Malik nonlinear diffusion model is the first PDE based method used in the image smoothing tasks. Afterwards the classical Mumford-Shah model was developed to solve both image segmentation and smoothing problems and it is based on the minimization of an energy functional. It has numerous application areas such as edge detection, motion analysis, medical i...
Shunting inhibitory cellular neural networks with strongly unpredictable oscillations
Akhmet, Marat; Tleubergenova, Madina; Zhamanshin, Akylbek (Elsevier BV, 2020-10-01)
The paper considers a new type of solutions for shunting inhibitory cellular neural networks (SICNNs), strongly unpredictable oscillations. The conditions for the existence, uniqueness and stability of the solutions are determined. Numerical examples are given to show the feasibility of the obtained results.
Manguoğlu, Murat; Sameh, Ahmed H.; Grama, Ananth (Society for Industrial & Applied Mathematics (SIAM), 2010-01-01)
The emergence of multicore architectures and highly scalable platforms motivates the development of novel algorithms and techniques that emphasize concurrency and are tolerant of deep memory hierarchies, as opposed to minimizing raw FLOP counts. While direct solvers are reliable, they are often slow and memory-intensive for large problems. Iterative solvers, on the other hand, are more efficient but, in the absence of robust preconditioners, lack reliability. While preconditioners based on incomplete factor...
Citation Formats
S. Ozogur-Akyuz, J. Shawe-Taylor, G. W. Weber, and Z. B. Ögel, “Pattern analysis for the prediction of fungal pro-peptide cleavage sites,” DISCRETE APPLIED MATHEMATICS, pp. 2388–2394, 2009, Accessed: 00, 2020. [Online]. Available: