A linear space algorithm for computing maximal common subsequences
Communications of the ACM
Streaming Algorithms for Biological Sequence Alignment on GPUs
IEEE Transactions on Parallel and Distributed Systems
Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
ICPP '09 Proceedings of the 2009 International Conference on Parallel Processing
Bioinformatics
GPU-ClustalW: using graphics hardware to accelerate multiple sequence alignment
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Hi-index | 0.00 |
Massively parallel platforms have been genuinely affordable over recent years. This breakthrough is the key factor that permits various research work that are continuously seeking for a better run-time performance of algorithms that process ever-growing amount of data. Multiple sequence alignment has been an important-yet-complex piece of algorithm in the computational sequence analysis field that naturally required to process huge sequence data. This proposed research looks into the strategies to utilise the massively parallel platforms in the quest of pursuing a better multiple sequence alignment in terms of throughput and parallel scalability. The initial strategies as well as the expected challenges are elaborated in this early phase of research. Current achievements as well as formulated future directions are discussed at the near end of this preliminary study.