A PC cluster based Parallel Algorithm for Longest Common Subsequence Problems

摘要：

Finding longest common subsequence (LCS) is one of the most important bioinformatics tasks. The algorithms time and space consumption will increase dramatically with the scale of the problem. This paper analyzed the existing LCS algorithms, and proposed a parallel algorithm. The algorithm was designed to running on PC clusters to achieve high performance. Experimental results showed that it is a practical low cost and efficient solution for sequences problem.

关键词： bioinformatics longest common subsequence parallel algorithm cluster

作者: Lei Xiao Hongzhi Song Meijie Zhu Yingjie Kuang

作者单位: Research Center for Human Computer Interaction College of Informatics South China Agricultural University Guangzhou, China

会议类型: 国际会议

会议名称: The 2nd International Conference on Bioinformatics and Biomedical Engineering(iCBBE 2008)(第二届生物信息与生物医学工程国际会议)

会议地点: 上海

会议语种:英文

页码: 820-823

在线出版日期: 2008-05-16（万方平台首次上网日期，不代表论文的发表时间）