Algorithm to find distant repeats in a single protein sequence

Banerjee, Nirjhar ; Sarani, Rangarajan ; Vasuki Ranjani, Chellamuthu ; Sowmiya, Govindaraj ; Michael, Daliah ; Balakrishnan, Narayanasamy ; Sekar, Kanagaraj (2008) Algorithm to find distant repeats in a single protein sequence Bioinformation, 3 (1). pp. 28-32. ISSN 0973-2063

PDF - Publisher Version

Official URL:


Distant repeats in protein sequence play an important role in various aspects of protein analysis. A keen analysis of the distant repeats would enable to establish a firm relation of the repeats with respect to their function and three-dimensional structure during the evolutionary process. Further, it enlightens the diversity of duplication during the evolution. To this end, an algorithm has been developed to find all distant repeats in a protein sequence. The scores from Point Accepted Mutation (PAM) matrix has been deployed for the identification of amino acid substitutions while detecting the distant repeats. Due to the biological importance of distant repeats, the proposed algorithm will be of importance to structural biologists, molecular biologists, biochemists and researchers involved in phylogenetic and evolutionary studies.

Item Type:Article
Source:Copyright of this article belongs to Biomedical Informatics.
Keywords:Distant Repeats; Genome Sequences; Point Accepted Mutation; Structure-function Relationship; Phylogeny
ID Code:64433
Deposited On:10 Oct 2011 07:32
Last Modified:18 May 2016 12:52

Repository Staff Only: item control page