cBrother: relaxing parental tree assumptions for Bayesian recombination detection.
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.


BACKGROUND
cBrother can be freely downloaded from http://www.biomath.org/dormanks/ and can be compiled on Linux, Macintosh and Windows operating systems. Online documentation and a tutorial are also available at the site.
Fang
Fang
F
Bioinformatics and Computational Biology Program, Iowa State University, Ames, IA 50011, USA.
Ding
Jing
J
Minin
Vladimir N
VN
Suchard
Marc A
MA
Dorman
Karin S
KS
D000465:Algorithms; D000595:Amino Acid Sequence; D001499:Bayes Theorem; D003198:Computer Simulation; D019143:Evolution, Molecular; D008957:Models, Genetic; D008969:Molecular Sequence Data; D011995:Recombination, Genetic / Q000235:genetics*; D017422:Sequence Analysis, DNA / Q000379:methods*; D012984:Software