%0 Journal Article
%T Parallel longest common subsequence algorithm based on pruning technology<br>最长公共子序列的快速算法及其并行实现
%A LIU Wei
%A CHEN Ling
%A <br>刘维
%J 计算机应用
%D 2006
%I 
%X Searching for the Longest Common Substring(LCS) of biosequences is one of the most important problems in Bioinformatics.Smith-Waterman algorithm and FASTA algorithm are currently the most widely used algorithms.FASTA algorithm runs faster than Smith-Waterman algorithm,but Smith-Waterman algorithm can obtain higher precision.A fast algorithm for LCS problem was presented.The algorithm seeks the successors of the identical character pairs in parallel according to a successor table and record their levels.Finally it traces back from identical character pair with the largest level and get the result of LCS.
%K bioinformaties
%K the longest common subsequence
%K the identical character pair<br>生物信息学
%K 最长公共子串
%K 同字符对
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=725BBC23B0EA9A68&yid=37904DC365DD7266&vid=96C778EE049EE47D&iid=B31275AF3241DB2D&sid=E64BF5BE957AB7AB&eid=AFD02B86BFB3C7FC&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=17