基于EBWT的加权序列比较并行化
分布式、并行与集群计算
2011-02-02 v3 数据结构与算法
摘要
扩展Burrows-Wheeler变换（EBWT）有助于发现两个序列之间的距离。现有算法的实现对于小规模序列需要耗费大量时间。在本文中，我们给出了使用NVIDIA统一计算设备架构（CUDA）的该算法并行实现。我们平均获得了2倍的性能提升。
引用
@article{arxiv.1011.0597,
title = {Parallelization of Weighted Sequence Comparison by using EBWT},
author = {Shashank Srikant},
journal= {arXiv preprint arXiv:1011.0597},
year = {2011}
}
备注
This paper has been withdrawn by the authors. Extended Burrows Wheeler transform; CUDA; Molecular Weighted Sequence; arXiv Admin note: Author list truncated due to authorship dispute