探索准确、高效、低成本、通用性并存的生物序列比对方法.将点阵图算法、启发式算法等各种序列比对算法中准确性最高的动态规划算法在计算机中实现,并通过流模型将其映射到图形硬件上,以实现算法加速；通过数据库比对搜索实例,进行比对时间和每秒百万次格点更新(MCUPS)性能值评测.结果表明,该加速算法在保证比对准确性的同时,能较大地提高比对速度.与目前最快的启发式算法相比,比对平均加速为18倍,最高加速可达28倍.%This paper is aimed to explore biological sequence alignment method with accuracy, efficiency, low-cost and universality. We achieved dynamic programming algorithms with higher accuracy than the other alignment algorithms, such as lattice diagram algorithm and heuristic algorithm, in computer and mapped it to the graphics hardware by stream model to speed up the algorithm. The alignment time and ( million cell updates per second, MCUPS) were used to evaluated the performance of the accelerated algorithm by an example of database alignment scanning. The result showed that the accelerated algorithm greatly improved the alignment speed and ensured the alignment accuracy at the same time. The alignment speed averagely was 18 times and maximally 28 times as fast as that of heuristic algorithm with highest speed at present.
展开▼
