Myers E W, Miller W
Department of Computer Science, University of Arizona, Tucson 85721.
Comput Appl Biosci. 1988 Mar;4(1):11-7. doi: 10.1093/bioinformatics/4.1.11.
Space, not time, is often the limiting factor when computing optimal sequence alignments, and a number of recent papers in the biology literature have proposed space-saving strategies. However, a 1975 computer science paper by Hirschberg presented a method that is superior to the new proposals, both in theory and in practice. The goal of this paper is to give Hirschberg's idea the visibility it deserves by developing a linear-space version of Gotoh's algorithm, which accommodates affine gap penalties. A portable C-software package implementing this algorithm is available on the BIONET free of charge.
在计算最优序列比对时,空间而非时间往往是限制因素,生物学文献中的一些近期论文提出了节省空间的策略。然而,赫希伯格1975年发表的一篇计算机科学论文提出了一种在理论和实践上都优于新提议的方法。本文的目标是通过开发一种适用于仿射间隙罚分的线性空间版本的戈托算法,使赫希伯格的想法得到应有的关注。一个实现该算法的便携式C软件包可在BIONET上免费获取。