Parallel stochastic search for protein secondary structure prediction

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Prediction of the secondary structure of a protein from its aminoacid sequence remains an important and difficult task. Up to this moment, three generations of Protein Secondary Structure Algorithms have been defined: The first generation is based on statistical information over single aminoacids, the second generation is based on windows of aminoacids-typically 11-21 aminoacids- and the third generation is based on the usage of evolutionary information. In this paper we propose the usage of naïve Bayes and Interval Estimation Naïve Bayes (IENB) -a new semi naïve Bayes approach- as suitable third generation methods for Protein Secondary Structure Prediction (PSSP). One of the main stages of IENB is based on a heuristic optimization, carried out by estimation of distribution algorithms (EDAs). EDAs are non-deterministic, stochastic and heuristic search strategies that belong to the evolutionary computation approaches. These algorithms under complex problems, like Protein Secondary Structure Prediction, require intensive calculation. This paper also introduces a parallel variant of IENB called PIENB (Parallel Interval Estimation Naïve Bayes).

Cite

CITATION STYLE

APA

Robles, V., Pérez, M. S., Herves, V., Peña, J. M., & Larrañaga, P. (2004). Parallel stochastic search for protein secondary structure prediction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3019, pp. 1162–1169). Springer Verlag. https://doi.org/10.1007/978-3-540-24669-5_149

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free