首页> 美国卫生研究院文献>BMC Bioinformatics >Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
【2h】

Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences

机译:随机序列之间精确和近似单词匹配的渐近行为和最佳单词大小

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

BackgroundThe number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the clustering of EST sequences. Sequence comparison based on D2 is extremely fast, its runtime is proportional to the size of the sequences under scrutiny, whereas alignment-based comparisons have a worst-case run time proportional to the square of the size. Recent studies have tackled the rigorous study of the statistical distribution of D2, and asymptotic regimes have been derived. The distribution of approximate k-word matches has also been studied.
机译:背景技术两个序列之间共享的k字数是一种简单有效的无比对序列比较方法。此统计数据D2已用于EST序列的聚类。基于D2的序列比较非常快,其运行时间与要仔细检查的序列的大小成正比,而基于比对的比较的最坏情况下的运行时间与大小的平方成正比。最近的研究已经对D2的统计分布进行了严格的研究,并且已经得出了渐近形式。还研究了近似k字匹配的分布。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号