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


Autoria(s): Sabarinathan, R; Banerjee, Nirjhar; Balakrishnan, N; Sekar, K
Data(s)

15/10/2010

Resumo

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. (C) 2010 Elsevier B.V. All rights reserved.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/33269/1/pair.pdf

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

Publicador

Elsevier Science

Relação

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

http://eprints.iisc.ernet.in/33269/

Palavras-Chave #BioInformatics Centre #Supercomputer Education & Research Centre
Tipo

Journal Article

PeerReviewed