A New Algorithm for the Longest Common Subsequence Problem

2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007) Pub Date : 2007-12-15 DOI:10.1109/CIS.WORKSHOPS.2007.209

Xuyu Xiang, Dafang Zhang, Jiaohua Qin

引用次数: 6

Abstract

In order to find the longest common subsequence (LCS) as soon as possible, we, with the method of match pairs, propose the new algorithm of the sequence of DNA, which is efficient both in time and in space on the basis of the improved dynamic programming theorem.

查看原文本刊更多论文

一种求解最长公共子序列问题的新算法

为了尽快找到最长公共子序列(LCS)，我们在改进的动态规划定理的基础上，采用匹配对的方法，提出了一种新的DNA序列求解算法，该算法在时间和空间上都是高效的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)

自引率

0.00%

发文量