DocumentCode :
1654840
Title :
A PC Cluster Based Parallel Algorithm for Longest Common Subsequence Problems
Author :
Xiao, Lei ; Song, Hongzhi ; Zhu, Meijie ; Kuang, Yingjie
Author_Institution :
Res. Center for Human Comput. Interaction, South China Agric. Univ., Guangzhou
fYear :
2008
Firstpage :
820
Lastpage :
823
Abstract :
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.
Keywords :
biology computing; genetics; parallel algorithms; LCS algorithms; PC cluster based parallel algorithm; bioinformatics; longest common subsequence problems; Algorithm design and analysis; Bioinformatics; Clustering algorithms; Costs; DNA; Educational institutions; Human computer interaction; Local area networks; Parallel algorithms; Sequences;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Bioinformatics and Biomedical Engineering, 2008. ICBBE 2008. The 2nd International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-1747-6
Electronic_ISBN :
978-1-4244-1748-3
Type :
conf
DOI :
10.1109/ICBBE.2008.201
Filename :
4535081
Link To Document :
بازگشت