Algorithm to find distant repeats in a single protein sequence

  • Banerjee N
  • Sarani R
  • Ranjani C
  • et al.
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Banerjee, N., Sarani, R., Ranjani, C. V., Sowmiya, G., Michael, D., Balakrishnan, N., & Sekar, K. (2008). Algorithm to find distant repeats in a single protein sequence. Bioinformation, 3(1), 28–32. https://doi.org/10.6026/97320630003028

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free