An algorithm to find distant repeats in a pair of protein sequences

Sabarinathan, R. ; Banerjee, Nirjhar ; Balakrishnan, N. ; Sekar, K. (2010) An algorithm to find distant repeats in a pair of protein sequences Pattern Recognition Letters, 31 (14). pp. 2161-2169. ISSN 0167-8655

Full text not available from this repository.

Official URL: http://www.sciencedirect.com/science/article/pii/S...

Related URL: http://dx.doi.org/10.1016/j.patrec.2010.04.010

Abstract

Distant repeats between a pair of protein sequences can be exploited to study the various aspects of proteins such as structure-function relationship, disorders due to protein malfunction, evolutionary analysis, etc. An in-depth analysis of the distant repeats would facilitate to establish a stable evolutionary relation of the repeats with respect to their three-dimensional structure. To this effect, an algorithm has been devised to identify the distant repeats in a pair of protein sequences by essentially using the scores of PAM (Percent Accepted Mutation) matrices. The proposed algorithm will be of much use to researchers involved in the comparative study of various organisms based on the amino-acid repeats in protein sequences.

Item Type:Article
Source:Copyright of this article belongs to Elsevier Science.
Keywords:Distant Repeats; Protein Sequences; PAM Matrix
ID Code:64427
Deposited On:10 Oct 2011 07:38
Last Modified:10 Oct 2011 07:38

Repository Staff Only: item control page