Research Article
A Parallel LCS Algorithm for Biosequences Alignment
@INPROCEEDINGS{10.4108/infoscale.2007.954, author={Wei Liu and Ling Chen and Lingjun Zou}, title={A Parallel LCS Algorithm for Biosequences Alignment}, proceedings={2nd International ICST Conference on Scalable Information Systems}, proceedings_a={INFOSCALE}, year={2010}, month={5}, keywords={Bioinformatics Parallel processing Biosequences alignment}, doi={10.4108/infoscale.2007.954} }- Wei Liu
Ling Chen
Lingjun Zou
Year: 2010
A Parallel LCS Algorithm for Biosequences Alignment
INFOSCALE
ICST
DOI: 10.4108/infoscale.2007.954
Abstract
Searching for the longest common substring (LCS) of biosequences is one of the most important tasks in Bioinformatics. A fast algorithm for LCS problem named FASTLCS is presented. The algorithm first seeks the successors of the initial identical character pairs according to a successor table to obtain all the identical pairs and their levels. Then by tracing back from the identical character pair at the largest level, the result of LCS can be obtained. For two sequences X and Y with lengths n and m, the memory required for FASTLCS is max{8(n+1)+8(m+1),L}, here L is the number of identical character pairs and time complexity of parallel implementation is O(|LCS(X, Y)|), here, |LCS(X, Y)| is the length of the LCS of X, Y. Experimental result on the gene sequences of tigr database shows that our algorithm can get exactly correct result and is faster and more efficient than other LCS algorithms.
