DocumentCode
3211048
Title
Computing all longest common subsequences on MPI cluster
Author
Lin, Jinxian ; Lv, Yiqing
Author_Institution
Network Inf. Center, Fuzhou Univ., Fuzhou, China
Volume
1
fYear
2010
fDate
13-14 Sept. 2010
Firstpage
386
Lastpage
389
Abstract
Finding out the longest common subsequences (LCS) is one of the most important problems of Bioengineering. But there is still not excellent algorithm for computing all of the longest common subsequences (ALCS). An existing fast algorithm for LCS was studied and improved in this paper. We combined the algorithm with MPI cluster and computed all the longest common subsequences of two random generate gene sequences on MPI cluster. The experiment results show that computing ALCS on MPI cluster is an efficient and practicality method.
Keywords
application program interfaces; biology computing; message passing; pattern clustering; sequences; MPI cluster; bioengineering; gene sequence; longest common subsequence; Algorithm design and analysis; Bioinformatics; Clustering algorithms; Computers; Heuristic algorithms; Parallel processing; Programming;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Natural Computing Proceedings (CINC), 2010 Second International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-7705-0
Type
conf
DOI
10.1109/CINC.2010.5643814
Filename
5643814
Link To Document