Skip Navigation


Bioinformatics Advance Access originally published online on March 16, 2006
Bioinformatics 2006 22(10):1269-1271; doi:10.1093/bioinformatics/btl097
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
22/10/1269    most recent
btl097v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by De Bie, T.
Right arrow Articles by Hahn, M. W.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by De Bie, T.
Right arrow Articles by Hahn, M. W.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

CAFE: a computational tool for the study of gene family evolution

Tijl De Bie 1, Nello Cristianini 2, Jeffery P. Demuth 3 and Matthew W. Hahn 3,*

1 K.U.Leuven, OKP Research Group Tiensestraat 102, 3000 Leuven, Belgium
2 Department of Statistics, U.C. Davis 360 Kerr Hall, One Shields Avenue, Davis CA 95616, USA
3 Department of Biology and School of Informatics, Indiana University 1001 E. Third Street Bloomington, IN 47405, USA

*To whom correspondence should be addressed.

Summary: We present CAFE (Computational Analysis of gene Family Evolution), a tool for the statistical analysis of the evolution of the size of gene families. It uses a stochastic birth and death process to model the evolution of gene family sizes over a phylogeny. For a specified phylogenetic tree, and given the gene family sizes in the extant species, CAFE can estimate the global birth and death rate of gene families, infer the most likely gene family size at all internal nodes, identify gene families that have accelerated rates of gain and loss (quantified by a p-value) and identify which branches cause the p-value to be small for significant families.

Availability: Software is available from http://www.bio.indiana.edu/~hahnlab/Software.html

Contact: mwh{at}indiana.edu

Received on January 20, 2006; revised on March 9, 2006; accepted on March 10, 2006

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Mol Biol EvolHome page
R. Zhang, Y.-Q. Wang, and B. Su
Molecular Evolution of a Primate-Specific microRNA Family
Mol. Biol. Evol., July 1, 2008; 25(7): 1493 - 1502.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
O. Sakarya, K. S. Kosik, and T. H. Oakley
Reconstructing ancestral genome content based on symmetrical best alignments and Dollo parsimony
Bioinformatics, March 1, 2008; 24(5): 606 - 612.
[Abstract] [Full Text] [PDF]

Home page
 GeneticsHome page
T. Matsuo
Rapid Evolution of Two Odorant-Binding Protein Genes, Obp57d and Obp57e, in the Drosophila melanogaster Species Group
Genetics, February 1, 2008; 178(2): 1061 - 1072.
[Abstract] [Full Text] [PDF]

Home page
 GeneticsHome page
M. W. Hahn, J. P. Demuth, and S.-G. Han
Accelerated Rate of Gene Gain and Loss in Primates
Genetics, November 1, 2007; 177(3): 1941 - 1949.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.