Finding Words with Unexpected Frequencies in Deoxyribonucleic Acid Sequences
识别DNA序列中频率异常的词串AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究DNA词串频率的马尔可夫模型检验,缺乏归入所列经济计量方向的直接依据。
反馈分类问题识别DNA序列中频率异常的词串AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
SUMMARY Considering a Markov chain model for deoxyribonucleic acid sequences, this paper proposes two asymptotically normal statistics to test whether the frequency of a given word is concordant with the first-order Markov chain model or not. The problem is to choose estimates μ^(W) of the expectation of the frequency Mw of a word W in the observed sequence such that the asymptotic variance of MW−μ^(W) is easily computable. The first estimator is derived from the frequency of W [– 1], which is W with its last letter deleted. The second, following an idea of Cowan, is the conditional expectation Mw given the observed frequencies of all two-letter words. Two examples on phage lambda and phage T7 are shown.