Prasanth, N and Vaishnavi, Kirti M and Sekar, K (2013) An algorithm to find all palindromic sequences in proteins. In: JOURNAL OF BIOSCIENCES, 38 (1). pp. 173-177.
|
PDF
jol_bio_38-1_173_2013.pdf - Published Version Download (264kB) | Preview |
Abstract
A palindrome is a set of characters that reads the same forwards and backwards. Since the discovery of palindromic peptide sequences two decades ago, little effort has been made to understand its structural, functional and evolutionary significance. Therefore, in view of this, an algorithm has been developed to identify all perfect palindromes (excluding the palindromic subset and tandem repeats) in a single protein sequence. The proposed algorithm does not impose any restriction on the number of residues to be given in the input sequence. This avant-garde algorithm will aid in the identification of palindromic peptide sequences of varying lengths in a single protein sequence.
Item Type: | Journal Article |
---|---|
Publication: | JOURNAL OF BIOSCIENCES |
Publisher: | INDIAN ACAD SCIENCES |
Additional Information: | Copyright for this article belongs to INDIAN ACAD SCIENCES, BANGALORE , INDIA |
Keywords: | Algorithm;histones;palindrome;proteins |
Department/Centre: | Division of Interdisciplinary Sciences > Supercomputer Education & Research Centre |
Date Deposited: | 15 Mar 2013 05:55 |
Last Modified: | 15 Mar 2013 05:55 |
URI: | http://eprints.iisc.ac.in/id/eprint/46057 |
Actions (login required)
View Item |