Suppr超能文献

通过在一台晶片机上进行并行处理,在大型数据库中搜索远缘相关的蛋白质序列。

Searching for distantly related protein sequences in large databases by parallel processing on a transputer machine.

作者信息

Vogt G, Argos P

机构信息

European Molecular Biology Laboratory, Heidelberg, FRG.

出版信息

Comput Appl Biosci. 1992 Feb;8(1):49-55. doi: 10.1093/bioinformatics/8.1.49.

Abstract

AliMac is an implementation of a sensitive sequence alignment algorithm on a parallel computer. The method achieves reliable alignments for very distantly related sequences from a combined use of amino acid exchange weights and physicochemical characteristics. The algorithm is computing intensive and its usage on conventional computers is limited to a relatively small number of sequences. The parallel implementation uses a Macintosh IIcx host computer and 21 transputers and achieves 22 times the speed of a VAX 8650 at a fraction of the cost. This paper describes the AliMac hardware and software and discusses problems and peculiarities of parallel implementations, especially with transputers. Finally, several popular sequence alignment algorithms are compared in their ability to detect distantly related sequences in searching large databases.

摘要

AliMac是一种在并行计算机上实现的敏感序列比对算法。该方法通过结合氨基酸交换权重和物理化学特性,为亲缘关系非常远的序列实现可靠的比对。该算法计算量很大,在传统计算机上的应用仅限于相对少量的序列。并行实现使用一台Macintosh IIcx主机和21个晶片机,成本仅为VAX 8650的一小部分,速度却达到了它的22倍。本文描述了AliMac的硬件和软件,并讨论了并行实现中的问题和特点,特别是与晶片机相关的问题。最后,比较了几种流行的序列比对算法在搜索大型数据库时检测亲缘关系远的序列的能力。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验