首页 | 本学科首页   官方微博 | 高级检索  
     

最优搜索机制下寻找最优插入-删除种子
引用本文:陈科,朱清新,杨曦.最优搜索机制下寻找最优插入-删除种子[J].电子科技大学学报(自然科学版),2011,40(2):292-295.
作者姓名:陈科  朱清新  杨曦
作者单位:1.电子科技大学计算机科学与工程学院 成都 610054;
摘    要:空位种子极大地提高了生物分子序列比对的灵敏度,但不适合大量存在插入和删除字符的序列.在空位种子的基础上,提出了带插入-删除的生物序列比对种子,进一步提高了生物序列比对的效率.实验表明,采用最优搜索算法可以有效地在给定约束条件下寻找到最优的插入-删除种子,并且插入-删除种子比同长度的最优空位种子具有更高的生物序列比对敏感...

关 键 词:插入-删除种子  生物分子序列比对  最优系统  空位种子
收稿时间:2009-06-25

Finding Optimal Indel Seeds under Optimal Search Mechanism
CHEN Ke,ZHU Qing-xin,YANG Xi.Finding Optimal Indel Seeds under Optimal Search Mechanism[J].Journal of University of Electronic Science and Technology of China,2011,40(2):292-295.
Authors:CHEN Ke  ZHU Qing-xin  YANG Xi
Affiliation:1.School of Computer Science and Engineering,University of Electronic Science and Technology of China Chengdu 610054;2.Chengdu Huaxi Middle School Chengdu 610051
Abstract:Spaced seeds greatly improve the sensitivity of bio-sequences alignment, but they are not applicable for the sequences containing many insertions and deletions.Based on spaced seeds, we propose seeds with insertions and deletions (Indel seeds), which improves the sequences alignment sensitivity more. Experiments show that adopting optimal search algorithm can find optimal indel seeds under given constraints, further more, indel seeds have higher bio-sequences alignment sensitivity than that of spaced seeds.
Keywords:
本文献已被 万方数据 等数据库收录!
点击此处可从《电子科技大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《电子科技大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号