4.7 Article

cBrother: relaxing parental tree assumptions for Bayesian recombination detection

期刊

BIOINFORMATICS
卷 23, 期 4, 页码 507-508

出版社

OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btl613

关键词

-

资金

  1. NIGMS NIH HHS [GM068955] Funding Source: Medline

向作者/读者索取更多资源

Bayesian multiple change-point models accurately detect recombination in molecular sequence data. Previous Java-based implementations assume a fixed topology for the representative parental data. cBrother is a novel C language implementation that capitalizes on reduced computational time to relax the fixed tree assumption. We show that cBrother is 19 times faster than its predecessor and the fixed tree assumption can influence estimates of recombination in a medically-relevant dataset.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据