• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Proceedings of the National Academy of Sciences of the United States of America >Recursions for statistical multiple alignment
【24h】

Recursions for statistical multiple alignment

机译：递归统计多元对齐

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Algorithms are presented that allow the calculation of the probability of a set of sequences related by a binary tree that have evolved according to the Thorne-Kishino-Felsenstein model for a fixed set of parameters. The algorithms are based on a Markov chain generating sequences and their alignment at nodes in a tree. Depending on whether the complete realization of this Markov chain is decomposed into the first transition and the rest of the realization or the last transition and the first part of the realization, two kinds of recursions are obtained that are computationally similar but probabilistically different. The running time of the algorithms is O(Π_i=1~d L_i), where L_i is the length of the ith observed sequences and d is the number of sequences. An alternative recursion is also formulated that uses only a Markov chain involving the inner nodes of a tree.
机译：提出了允许计算与二叉树相关的一组序列的概率的算法，这些二叉树已根据Thorne-Kishino-Felsenstein模型针对一组固定的参数进行了进化。该算法基于马尔可夫链生成序列及其在树中节点处的比对。根据此马尔可夫链的完整实现是分解为第一个过渡和该实现的其余部分，还是最后一个过渡和该实现的第一部分，得出两种递归，它们在计算上相似，但概率上不同。算法的运行时间为O（Π_i= 1〜d L_i），其中L_i是第i个观测序列的长度，d是序列数。还提出了一种替代递归，该递归仅使用涉及树的内部节点的马尔可夫链。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号