Relevant and Non-Redundant Amino Acid Sequence Selection for Protein Functional Site Identification

Relevant and Non-Redundant Amino Acid Sequence Selection for Protein Functional Site Identification

Chandra Das (West Bengal University of Technology, India) and Pradipta Maji (Indian Statistical Institute, India)
Copyright: © 2012 |Pages: 26
DOI: 10.4018/978-1-4666-0264-9.ch009
OnDemand PDF Download:
No Current Special Offers


In order to apply a powerful pattern recognition algorithm to predict functional sites in proteins, amino acids cannot be used directly as inputs since they are non-numerical variables. Therefore, they need encoding prior to input. In this regard, the bio-basis function maps a non-numerical sequence space to a numerical feature space. One of the important issues for the bio-basis function is how to select a minimum set of bio-basis strings with maximum information. In this paper, an efficient method to select bio-basis strings for the bio-basis function is described integrating the concepts of the Fisher ratio and “degree of resemblance”. The integration enables the method to select a minimum set of most informative bio-basis strings. The “degree of resemblance” enables efficient selection of a set of distinct bio-basis strings. In effect, it reduces the redundant features in numerical feature space. Quantitative indices are proposed for evaluating the quality of selected bio-basis strings. The effectiveness of the proposed bio-basis string selection method, along with a comparison with existing methods, is demonstrated on different data sets.
Chapter Preview


Cognitive informatics is the cross fertilization between computer science, artificial intelligence, systems science, cognitive science, neuropsychology, life science, and so forth (Wang, 2009a; Wang, 2009b; Wang et al., 2006b). It investigates the internal information processing mechanisms and processes of natural intelligence, and forges links between a number of natural science and life science disciplines with informatics and computing science (Wang et al., 2006a; Wang et al., 2006b).

The fundamental methodology of cognitive informatics uses informatics and computing techniques to investigate cognitive science problems such as memory, learning, and reasoning in one direction, although it is bidirectional and comparative in nature (Wang, 2009a; Wang, 2009b; Wang et al., 2006a; Wang et al., 2009; Wang et al., 2006b). In this paper, a new learning algorithm is presented to select a set of relevant and non-redundant amino acid sequences for identification of protein functional sites.

Recent advancement and wide use of high-throughput technology for biological research are producing enormous size of biological data. The successful analysis of biological data has become critical. Although laboratory experiment is the most effective method to analyze the biological data, it is very financially expensive and labor intensive. Pattern recognition techniques and machine learning methods provide useful tools for analyzing the biological data (Arrigo et al., 1991; Ferran et al., 1991; Cai et al., 1998; Baldi et al., 1995).

The prediction of functional sites in proteins is an important issue in protein function studies and hence, drug design. As a result, most researchers use protein sequences for the analysis or the prediction of protein functions in various ways (Baldi et al., 1998; Yang, 2004). Thus, one of the major tasks in bioinformatics is the classification and prediction of protein sequences. There are two types of analysis of protein sequences. The first is to analyze whole sequences aiming to annotate novel proteins or classify proteins. In this method the protein function is annotated through aligning a novel protein sequence with a known protein sequence. If the similarity between a novel sequence and a known sequence is very high, the novel protein is believed to have the same or similar function as the known protein. The second is to recognize functional sites within a sequence. The latter normally deals with subsequences (Yang, 2004).

Complete Chapter List

Search this Book: