Vogt G, Argos P
European Molecular Biology Laboratory, Heidelberg, Germany.
Comput Appl Biosci. 1993 Feb;9(1):25-8. doi: 10.1093/bioinformatics/9.1.25.
An implementation of Profilesearch (a technique to search for relationships between a protein sequence and multiply aligned sequences) for a parallel computer is described. The number-crunching machine, consisting of 21 T800 transputers, is connected to a Macintosh IIcx host computer. The program utilizes a standard Macintosh application as its user-interface, resulting in a transparent and user-friendly environment for addressing the parallel computer. The program is independent of the number of available processors and exceeds the speed of a VAXstation 3200 with only one transputer in operation, thus allowing cheap and fast database searches with a PC front-end. For a larger number of processors, the speed increase is approximately linear with no obvious symptoms of saturation with the available maximum of 21 transputers. The program and environment are useful to search quickly and easily for similarities between a single sequence or sequence set and individual sequences contained in a large database. The alignment is determined by typical dynamic programming techniques.
描述了一种用于并行计算机的Profilesearch(一种搜索蛋白质序列与多重比对序列之间关系的技术)的实现。这台由21个T800晶片机组成的数字运算机器连接到一台Macintosh IIcx主机上。该程序使用标准的Macintosh应用程序作为其用户界面,从而为使用并行计算机提供了一个透明且用户友好的环境。该程序与可用处理器的数量无关,并且在仅运行一个晶片机的情况下就超过了VAXstation 3200的速度,因此可以通过PC前端进行廉价且快速的数据库搜索。对于更多数量的处理器,速度提升大致呈线性,在可用的最多21个晶片机的情况下没有明显的饱和迹象。该程序和环境有助于快速轻松地搜索单个序列或序列集与大型数据库中包含的各个序列之间的相似性。比对由典型的动态规划技术确定。