Abstract
Summary: 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. © 2007 Oxford University Press.
Cite
CITATION STYLE
Fang, F., Ding, J., Minin, V. N., Suchard, M. A., & Dorman, K. S. (2007). cBrother: Relaxing parental tree assumptions for Bayesian recombination detection. Bioinformatics, 23(4), 507–508. https://doi.org/10.1093/bioinformatics/btl613
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.