A PC Cluster Based Parallel Algorithm for Longest Common Subsequence Problems

Lei Xiao,Hongzhi Song,Meijie Zhu,Yingjie Kuang

Shanghai（2008）

引用 2|浏览2

暂无评分

摘要

Finding longest common subsequence (LCS) is one of the most important bioinformatics tasks. The algorithm's 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.

查看译文

关键词

longest common subsequence problems,genetics,longest common subsequence,cluster,biology computing,parallel algorithms,parallel algorithm,bioinformatics,pc cluster based parallel algorithm,lcs algorithms,clustering algorithms,sequences,local area networks,dna,algorithm design and analysis,human computer interaction

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要