Indexed by：
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. ©2010 IEEE.
Keyword：
Reprint 's Address：
Email：
Source ：
2010 2nd International Conference on Computational Intelligence and Natural Computing, CINC 2010
Year： 2010
Volume： 1
Page： 386-389
Language： English
Cited Count：
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 6
Affiliated Colleges：
