首页> 外文会议>2018 Recent Advances on Engineering, Technology and Computational Sciences >Similarity Detection in Biological Sequences using Parameterized Matching and Q-gram
【24h】

Similarity Detection in Biological Sequences using Parameterized Matching and Q-gram

机译:使用参数化匹配和Q-gram的生物序列相似性检测

获取原文
获取原文并翻译 | 示例

摘要

Whenever characterization of a new DNA sequence takes place then, database search is carried out to find whether homolog’s of gene is present or not. Various evolutions in this field have marked the shift from exact matching to a completely different concept, parameterized matching. Parameterized matching is detected by consistent renaming of text and pattern using bijective mapping. While finding matches between pattern and text, the PBMH-Hash algorithm results in frequent occurrence of false matches with large number of character comparison. This paper presents a new algorithm to detect similarity in biological sequences. The proposed algorithm is based on the concept of Berry-Ravindran algorithm and q-Gram. Analysis shows that our algorithm outperforms existing PBMH-Hash algorithm.
机译:每当对新的DNA序列进行表征时,就会进行数据库搜索以查找是否存在基因的同源物。该领域的各种发展标志着从精确匹配到完全不同的概念(参数化匹配)的转变。通过使用双射映射一致地重命名文本和模式,可以检测到参数化的匹配。在查找图案和文本之间的匹配项时,PBMH-Hash算法会导致错误匹配项频繁出现,并且会进行大量字符比较。本文提出了一种检测生物序列相似性的新算法。该算法基于Berry-Ravindran算法和q-Gram的概念。分析表明,我们的算法优于现有的PBMH-Hash算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号