arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0704.3221math.PRmath.COmath.STq-bio.GNq-bio.QMstat.TH
收藏

多模式匹配:一种马尔可夫链方法

Multiple pattern matching: A Markov chain approach

Manuel Lladser, M. D. Betterton, Rob Knight

摘要:

RNA基序通常由短的模块化模式组成,包括在模块内和模块之间形成的碱基对。估计这些模式的丰度对于评估全基因组搜索中匹配的统计学意义以及预测给定功能是否在不同物种中进化多次或起源于单个共同祖先具有根本重要性。在这篇手稿中,我们回顾了自动机理论的一些基本概念,生成函数和转移矩阵的方法,在生物序列的模式分析相关的集成和自包含的方式。我们形式化,在一个一般的框架,马尔可夫链嵌入的概念,分析模式的随机字符串产生的无记忆信源。这种概念化,再加上自动机识别复杂模式的能力,可以系统地分析与随机字符串中模式的出现和频率有关的问题。我们提出的应用程序集中在自动机同步的概念,以及自动机用于搜索有限数量的关键字(包括根据基本配对规则生成的模式集)在一般的文本。

英文摘要:

RNA motifs typically consist of short, modular patterns that include base pairs formed within and between modules. Estimating the abundance of these patterns is of fundamental importance for assessing the statistical significance of matches in genomewide searches, and for predicting whether a given function has evolved many times in different species or arose from a single common ancestor. In this manuscript, we review in an integrated and self-contained manner some basic concepts of automata theory, generating functions and transfer matrix methods that are relevant to pattern analysis in biological sequences. We formalize, in a general framework, the concept of Markov chain embedding to analyze patterns in random strings produced by a memoryless source. This conceptualization, together with the capability of automata to recognize complicated patterns, allows a systematic analysis of problems related to the occurrence and frequency of patterns in random strings. The applications we present focus on the concept of synchronization of automata, as well as automata used to search for a finite number of keywords (including sets of patterns generated according to base pairing rules) in a general text.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑