Algorithms for computing evolutionary similarity measures with length independent gap penalties
- 34 Downloads
We give algorithms for computing the extent of similarity between two or three sequences of letters. The similarity measures we consider include a penalty for inserting gaps within the sequence in order to enhance similarity. The magnitude of the penalty for gaps is assumed to be independent of their size in order to accommodate certain biological applications. Our algorithm for three sequence comparisons, which is based on solving a system of recursive equations, improves upon the efficiency of existing methods. Although the system of recursive equations utilized by the algorithm is quite complicated as it stands, it has none the less been simplified by appeal to combinatorial considerations.
KeywordsSimilarity Measure Dynamic Programming Algorithm Normal Sequence Recursive Equation Optimal Alignment
Unable to display preview. Download preview PDF.
- Doolittle, R. F. 1981. “Similar Amino Acid Sequences: Chance or Common Ancestry?”Science 214, 149–159.Google Scholar