Miller W, Ostell J, Rudd K E
Department of Computer Science, Pennsylvania State University, University Park 16802.
Comput Appl Biosci. 1990 Jul;6(3):247-52. doi: 10.1093/bioinformatics/6.3.247.
This paper presents an algorithm that searches a DNA restriction enzyme map for regions that approximately match a shorter 'probe' map. Both the map and the probe consist of a sequence of address-enzyme pairs denoting restriction sites, and the algorithm penalizes a potential match for undetected or missing sites and for discrepancies in the distance between adjacent sites. The algorithm was designed specifically for comparing relatively short DNA sequences with a long restriction map, a problem that will become increasing common as large physical maps are generated. The algorithm has been used to extract information from a restriction map of the entire Escherichia coli genome.
本文提出了一种算法，该算法在DNA限制酶图谱中搜索与较短“探针”图谱大致匹配的区域。图谱和探针均由表示限制位点的地址-酶对序列组成，并且该算法会对未检测到或缺失的位点以及相邻位点之间距离的差异对潜在匹配进行惩罚。该算法专为将相对较短的DNA序列与长限制图谱进行比较而设计，随着大型物理图谱的生成，这个问题将变得越来越普遍。该算法已被用于从整个大肠杆菌基因组的限制图谱中提取信息。
