PATTERN-RECOGNITION IN GENETIC SEQUENCES

被引:39
作者
SELLERS, PH
机构
关键词
D O I
10.1073/pnas.76.7.3041
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
This paper announces an algorithm for finding pattern similarities between two given finite sequences. Two portions, one from each sequence, are similar if they are close in the metric space of evolutionary distances. In its most general form the algorithm allows a complete list to be made of all pairs of intervals, one from each of the two given sequences, such that each pair displays a maximum local degree of similarity; if the lengths of the sequences are m and n, then the algorithm requires on the order of mn steps. This result lends itself to detecting similarities by computer between pairs of biological sequences, such as proteins and nucleic acids.
引用
收藏
页码:3041 / 3041
页数:1
相关论文
共 2 条
[1]   THEORY AND COMPUTATION OF EVOLUTIONARY DISTANCES [J].
SELLERS, PH .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1974, 26 (04) :787-793
[2]  
ULAM SM, 1972, APPLICATIONS NUMBER, P1