...
首页> 外文期刊>Journal of the royal statistical society >Peptide refinement by using a stochastic search
【24h】

Peptide refinement by using a stochastic search

机译:通过随机搜索提炼肽

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

摘要

Identifying a peptide on the basis of a scan from a mass spectrometer is an important yet highly challenging problem. To identify peptides, we present a Bayesian approach which uses prior information about the average relative abundances of bond cleavages and the prior probability of any particular amino acid sequence. The scoring function proposed is composed of two overall distance measures, which measure how close an observed spectrum is to a theoretical scan for a peptide. Our use of our scoring function, which approximates a likelihood, has connections to the generalization presented by Bissiri and co-workers of the Bayesian framework. A Markov chain Monte Carlo algorithm is employed to simulate candidate choices from the posterior distribution of the peptide sequence. The true peptide is estimated as the peptide with the largest posterior density.
机译:基于来自质谱仪的扫描来鉴定肽是重要但极富挑战性的问题。为了鉴定肽,我们提出了一种贝叶斯方法,该方法使用有关键断裂的平均相对丰度和任何特定氨基酸序列的先验概率的先验信息。提出的评分功能由两个总体距离量度组成,这两个量度量度了观察到的光谱与肽的理论扫描之间的接近程度。我们对评分函数的使用(近似可能性)与Bissiri和贝叶斯框架的同事所提出的概括有关。马尔可夫链蒙特卡罗算法用于模拟从肽序列的后验分布中选择候选对象。真实肽被估计为具有最大后密度的肽。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号