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

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.

PDF pair.pdf - Published Version Restricted to Registered users only Download (225kB) | Request a copy

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

Item Type:	Journal Article
Publication:	Pattern Recognition Letters
Publisher:	Elsevier Science
Additional Information:	Copyright of this article belongs to Elsevier Science.
Keywords:	Distant repeats; Protein sequences; PAM matrix.
Department/Centre:	Division of Information Sciences (Doesn't exist now) > BioInformatics Centre Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre
Date Deposited:	18 Oct 2010 07:17
Last Modified:	18 Oct 2010 07:17
URI:	http://eprints.iisc.ac.in/id/eprint/33269

Actions (login required)

View Item