## Abstract

Motivation: Circular permutation of a protein is a genetic operation in which part of the C-terminal of the protein is moved to its N-terminal. Recently, it has been shown that proteins that undergo engineered circular permutations generally maintain their three dimensional structure and biological function. This observation raises the possibility that circular permutation has occured in Nature during evolution. In this scenario a protein underwent circular permutation into another protein, thereafter both proteins further diverged by standard genetic operations. To study this possibility one needs apt efficient algorithm that for a given pair of proteins can detect the underlying event of circular permutations. A possible formal description of the question is: given two sequences, find a circular permutation of one of them under which the edit distance between the proteins is minimal. A naive algorithm might take time proportional to N^{3} or even N^{4}, which is prohibitively slow for a large-scale survey. A sophisticated algorithm that runs in asymptotic time of N^{2} was recently suggested but it is not practical for a large-scale survey. Results: A simple and efficient algorithm that runs in time N2 is presented. The algorithm is based on duplicating one of the two sequences, and then performing a modified version of the standard dynamic programming algorithm. While the algorithm is not guaranteed to find the optimal results, we present data that indicate that in practice the algorithm performs very well. Availability: A Fortran program that calculates the optimal edit distance under circular permutation is available upon request from the authors. Contact: [email protected].

Original language | English |
---|---|

Pages (from-to) | 930-936 |

Number of pages | 7 |

Journal | Bioinformatics |

Volume | 15 |

Issue number | 11 |

DOIs | |

State | Published - Nov 1999 |