NMLCS: A Novel Parallel Algorithm for Searching for the Multiple Longest Common Subsequences
Searching for the multiple longest common subsequences (MLCS) has found significant applications in the areas of bioinformatics, information processing, data mining, etc. There is a variety of MLCS algorithms, but none of the existing algorithms give effective solutions under the condition of a large alphabet, a considerable number of sequences and a long average length of sequences. Aiming at the defects of the MLCS algorithms available, this paper proposes a novel parallel algorithm for the MLCS—NMLCS based on the ideas of parallel processing and match pair by pre-processing. Experimental results show that our NMLCS resolves the problems mentioned above with great efficiency and significantly reduces time-space complexity as compared with other MLCS algorithms.
MLCS match parallel processing
Yanni Li Yuping Wang Xiaofei Yang Zhensong Zhang Ying Zheng
Software Engineering Institute Xidian Univesity Xian, China School of Computer Science and Engineering Xidian Univesity Xian, China School of Software Xidian Univesity Xian, China School of Software Xidian Univesity Xian. China
国际会议
重庆
英文
506-513
2011-01-21（万方平台首次上网日期，不代表论文的发表时间）