Computational Discovery of Gene Regulatory Binding Motifs: A Bayesian Perspective

Loading...
Thumbnail Image
Penn collection
Statistics Papers
Degree type
Discipline
Subject
gene regulation
motif discovery
Bayesian models
scoring functions
optimization
Markov chain Monte Carlo
Statistics and Probability
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Jensen, Shane T
Liu, X. Shirley
Zhou, Qing
Liu, Jun S
Contributor
Abstract

The Bayesian approach together with Markov chain Monte Carlo techniques has provided an attractive solution to many important bioinformatics problems such as multiple sequence alignment, microarray analysis and the discovery of gene regulatory binding motifs. The employment of such methods and, more broadly, explicit statistical modeling, has revolutionized the field of computational biology. After reviewing several heuristics-based computational methods, this article presents a systematic account of Bayesian formulations and solutions to the motif discovery problem. Generalizations are made to further enhance the Bayesian approach. Motivated by the need of a speedy algorithm, we also provide a perspective of the problem from the viewpoint of optimizing a scoring function. We observe that scoring functions resulting from proper posterior distributions, or approximations to such distributions, showed the best performance and can be used to improve upon existing motif-finding programs. Simulation analyses and a real-data example are used to support our observation.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2004-01-01
Journal title
Statistical Science
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Recommended citation
Collection