• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computing Methodologies and Communication >Genetic Sequence Alignment: A Comparative Study of Methods
【24h】

Genetic Sequence Alignment: A Comparative Study of Methods

机译：遗传序列对准：方法的比较研究

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The field of bioinformatics is an extensive and rich area of research. Most efforts today focus on genetic sequence alignment which is needed to be performed in almost all genomic studies. It is the positioning of two gene sequences (Deoxyribonucleic Acid (DNA), Ribonucleic acid (RNA), peptide sequence, and so on) such that their similar regions are matched. This alignment is then scored by taking weighted sum of the matches, mismatches, and gaps (indels). The alignment is considered to be significant if the score satisfies a certain threshold. Over the years, vast research has been conducted to tackle the enormous problem of alignment of human genetic sequences efficiently for the purpose of newborn genetic screening and early detection of genetic disorders. The human DNA, which is over 3 billion base pairs long, presents a challenge to these methods as they attempt to run in an acceptable amount of time and memory space. This paper presents an overview of the most prominent algorithms along with their asymptotic analysis. It is our hope that a comparative view of the various methods shall help to determine which one or more of them can be considered for further betterment
机译：生物信息学领域是一种广泛而丰富的研究领域。今天大多数努力关注在几乎所有基因组研究中需要进行的遗传序列比对。它是两个基因序列的定位（脱氧核糖核酸（DNA），核糖核酸（RNA），肽序列等），使得它们类似的区域匹配。然后通过将匹配，不匹配和间隙（indels）的加权总和进行评分来评分该对准。如果分数满足某个阈值，则认为对准是显着的。多年来，已经进行了巨大的研究，以解决新生遗传筛查和早期检测遗传紊乱的目的的人遗传序列的巨大问题。人类DNA超过30亿基对长，对这些方法提出了挑战，因为它们试图在可接受的时间和记忆空间中运行。本文概述了最突出的算法以及它们的渐近分析。我们希望各种方法的比较观点应有助于确定哪一个或多个可以考虑进一步提高

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号