An algorithm to find all identical internal sequence repeats

Proteins containing amino acid repeats are considered to be of great importance in evolutionary studies. The principal mechanism of formation of amino acid repeats is by the duplication or recombination of genes. Thus, repeats are found in both nucleotide and protein sequences. In proteins, repeats are involved in protein-protein interactions as well as in binding to other ligands such as DNA and RNA. The study of internal sequence repeats would be helpful to scientists in various fields, including structural biology, enzymology, phylogenetics, genomics and proteomics. Hence an algorithm (Finding All Internal Repeats, FAIR) has been designed utilizing the concepts of dynamic programing to identify the repeats. The proposed algorithm is a faster and more efficient method to detect internal sequence repeats in both protein and nucleotide sequences, than those found in the literature. The algorithm has been implemented in $C^{++}$ and a web-based computing engine, IdentSeek, has been developed to make FAIR accessible to the scientific community. IdentSeek produces a clear, detailed result (including the location of the repeat in the sequence and its length), which can be accessed through the world wide web at the URL http://bioserver1.physics.iisc.ernet.in/ident/