Abstract Two macromolecular sequences which have evolved from a common ancestor sequence will tend to include a large number of elements unaffected by replacement mutations in both sequences, as long as the evolutionary rate is not too high or the divergence time is not too great. The positions of corresponding elements may have changed in either daughter sequence due to deletion/insertion mutations involving other sequence elements, but their order can be expected to be the same in both sequences. These sets of correspondences, called matches, may be computed by a recursive algorithm which incorporates constraints on the number of deletion/insertion mutations hypothesized to have occurred. A test is developed which computes the significance of each deletion/insertion hypothesized, based on Monte-Carlo sampling of random sequences with the same base composition as the experimental sequences being tested. Applying the test to 5 S RNAs confirms the relation of Escherichia coli and KB carcinoma 5 S RNAs and establishes the previously undetected homology between Pseudomonas fluorescens and KB 5 S RNAs.
[1]
S. B. Needleman,et al.
A general method applicable to the search for similarities in the amino acid sequence of two proteins.
,
1970,
Journal of molecular biology.
[2]
S. Weissman,et al.
Nucleotide sequence of Pseudomonas fluorescens 5 S ribonucleic acid.
,
1971,
The Journal of biological chemistry.
[3]
G G Brownlee,et al.
The sequence of 5 s ribosomal ribonucleic acid.
,
1968,
Journal of molecular biology.
[4]
S. Weissman,et al.
Nucleotide Sequence of KB Cell 5S RNA
,
1967,
Science.
[5]
W. Fitch.
An improved method of testing for evolutionary homology.
,
1966,
Journal of molecular biology.
[6]
M. O. Dayhoff,et al.
Atlas of protein sequence and structure
,
1965
.