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

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

{"title":"一种求解最长公共子序列问题的新算法","authors":"Xuyu Xiang, Dafang Zhang, Jiaohua Qin","doi":"10.1109/CIS.WORKSHOPS.2007.209","DOIUrl":null,"url":null,"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.","PeriodicalId":409737,"journal":{"name":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","volume":"353 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A New Algorithm for the Longest Common Subsequence Problem\",\"authors\":\"Xuyu Xiang, Dafang Zhang, Jiaohua Qin\",\"doi\":\"10.1109/CIS.WORKSHOPS.2007.209\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":409737,\"journal\":{\"name\":\"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)\",\"volume\":\"353 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.WORKSHOPS.2007.209\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.WORKSHOPS.2007.209","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

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

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

查看原文本刊更多论文

A New Algorithm for the Longest Common Subsequence Problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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

自引率

0.00%

发文量