...
首页> 外文期刊>BMC Bioinformatics >A response to Yu et al. 'A forward-backward fragment assembling algorithm for the identification of genomic amplification and deletion breakpoints using high-density single nucleotide polymorphism (SNP) array', BMC Bioinformatics 2007, 8: 145
【24h】

A response to Yu et al. 'A forward-backward fragment assembling algorithm for the identification of genomic amplification and deletion breakpoints using high-density single nucleotide polymorphism (SNP) array', BMC Bioinformatics 2007, 8: 145

机译:对Yu等人的回应。 “使用高密度单核苷酸多态性(SNP)阵列鉴定基因组扩增和缺失断点的前向后片段组装算法”,BMC Bioinformatics 2007,8:145

获取原文

摘要

Background Yu et al. (BMC Bioinformatics 2007,8: 145+) have recently compared the performance of several methods for the detection of genomic amplification and deletion breakpoints using data from high-density single nucleotide polymorphism arrays. One of the methods compared is our non-homogenous Hidden Markov Model approach. Our approach uses Markov Chain Monte Carlo for inference, but Yu et al. ran the sampler for a severely insufficient number of iterations for a Markov Chain Monte Carlo-based method. Moreover, they did not use the appropriate reference level for the non-altered state. Methods We rerun the analysis in Yu et al. using appropriate settings for both the Markov Chain Monte Carlo iterations and the reference level. Additionally, to show how easy it is to obtain answers to additional specific questions, we have added a new analysis targeted specifically to the detection of breakpoints. Results The reanalysis shows that the performance of our method is comparable to that of the other methods analyzed. In addition, we can provide probabilities of a given spot being a breakpoint, something unique among the methods examined. Conclusion Markov Chain Monte Carlo methods require using a sufficient number of iterations before they can be assumed to yield samples from the distribution of interest. Running our method with too small a number of iterations cannot be representative of its performance. Moreover, our analysis shows how our original approach can be easily adapted to answer specific additional questions (e.g., identify edges).
机译:背景Yu等。 (BMC Bioinformatics 2007,8:145+)最近比较了使用来自高密度单核苷酸多态性阵列的数据检测基因组扩增和缺失断点的几种方法的性能。比较的方法之一是我们的非均匀隐马尔可夫模型方法。我们的方法使用马尔可夫链蒙特卡罗法进行推论,但是Yu等人。对于基于Markov Chain Monte Carlo的方法,运行采样器的迭代次数严重不足。此外,他们没有为未更改状态使用适当的参考级别。方法我们重新进行了Yu等人的分析。对Markov Chain Monte Carlo迭代和参考水平使用适当的设置。此外,为了显示获得其他特定问题答案的难易程度,我们添加了专门针对断点检测的新分析。结果重新分析表明,我们的方法的性能可与其他方法相媲美。此外,我们可以提供给定点作为断点的概率,这在所检查的方法中是唯一的。结论马尔可夫链蒙特卡罗方法需要使用足够多的迭代,然后才能假定它们从感兴趣的分布中产生样本。迭代次数过少运行我们的方法不能代表其性能。此外,我们的分析表明,我们的原始方法如何轻松地适用于回答特定的其他问题(例如,识别边缘)。

著录项

相似文献

  • 外文文献
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号