A time efficient algorithm for finding longest common subsequence from two molecular sequences

机译：一种高效的算法，可从两个分子序列中找到最长的公共子序列

获取原文

页面导航

摘要
著录项
相似文献
相关主题

摘要

This paper presents a new algorithm for finding longest common subsequence from two given sequences of DNA, proteins etc of interest. We have presented a sequential algorithm, which is quite effective. Our method compares the given database sequence of DN

机译：本文提出了一种新算法，可以从两个给定的感兴趣的DNA，蛋白质等给定序列中找到最长的公共子序列。我们提出了一种顺序算法，该算法非常有效。我们的方法比较给定的DN数据库序列

著录项

来源
《Bioengineering Conference, 2007 IEEE 33rd Annual Northeast》|2007年|P.302-306|共5页
会议地点
作者
Rizvi; S.A.M.; Agarwal; P.;
展开▼
作者单位

展开▼
会议组织
原文格式 PDF
正文语种
中图分类工业技术;
关键词
DNA; biology computing; computational complexity; genetics; molecular biophysics; query processing; sequences; sorting; DNA sequences; bucket sorting method; database sequence; longest common subsequence; molecular sequences; partial genetic structure; query sequence;

机译：DNA;生物学计算;计算复杂度;遗传学;分子生物物理学;查询处理;序列;排序; DNA序列;桶分类法;数据库序列;最长共同子序列;分子序列;部分遗传结构;查询序列;

相似文献

外文文献
中文文献
专利

1. An Efficient Fast Pruned Parallel Algorithm for finding Longest Common Subsequences in BioSequences [J] . Sumathy Eswaran, S. P. RajaGopalan Annals. Computer Science Series . 2010,第1期

机译：在生物序列中找到最长共同子序列的高效快速修剪并行算法
2. Efficient algorithms for finding a longest common increasing subsequence [J] . Chan WT, Zhang Y, Fung SPY, Journal of combinatorial optimization . 2007,第3期

机译：寻找最长的公共递增子序列的高效算法
3. Efficient algorithms for finding a longest common increasing subsequence [J] . Wun-Tat Chan, Yong Zhang, Stanley P. Y. Fung, Journal of Combinatorial Optimization . 2007,第3期

机译：寻找最长的公共递增子序列的高效算法
4. A time efficient algorithm for finding longest common subsequence from two molecular sequences [C] . Rizvi, S.A.M., Agarwal, Bioengineering Conference, 2007 IEEE 33rd Annual Northeast . 2007

机译：一种高效的算法，可从两个分子序列中找到最长的公共子序列
5. Genetic algorithm approaches for efficient multiple molecular sequence alignment. [D] . Zhang, Ching. 1998

机译：高效的多分子序列比对的遗传算法方法。
6. Efficient algorithms for Longest Common Subsequence of two bucket orders to speed up pairwise genetic map comparison [O] . Lisa De Mattéo, Yan Holtz, Vincent Ranwez, -1

机译：两个存储桶顺序的最长公共子序列的高效算法可加快成对遗传图谱的比较
7. Efficient algorithms for Longest Common Subsequence of two bucket orders to speed up pairwise genetic map comparison [O] . Lisa De Mattéo, Yan Holtz, Vincent Ranwez, 2018

机译：高效算法，用于两个铲斗订单的最长常见子序列，以加速成对遗传地图比较

A time efficient algorithm for finding longest common subsequence from two molecular sequences

摘要

著录项

相似文献

相关主题

期刊订阅