用EBWT实现加权序列比较的简化
Parallelization of Weighted Sequence Comparison by using EBWT
摘要:
扩展Burrows Wheeler变换(EBWT)有助于找到两个序列之间的距离。现有算法的实现对于小尺寸序列需要相当多的时间。在本文中,我们给出了一个并行实现该算法使用NVIDIA计算统一设备架构(CUDA)。平均而言,我们在性能上获得了2倍的改进。
英文摘要:
The Extended Burrows Wheeler transform (EBWT) helps to find the distance between two sequences. Implementation of an existing algorithm takes considerable amount of time for small size sequences. In this paper, we give a parallel implementation of this algorithm using NVIDIA Compute Unified Device Architecture (CUDA). We have obtained, on an average, a 2X improvement in the performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。