Bioinformatics Advance Access originally published online on April 27, 2009
Bioinformatics 2009 25(13):1640-1646; doi:10.1093/bioinformatics/btp283
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Optimizing static thermodynamic models of transcriptional regulation
Institute for Molecular Bioscience, The University of Queensland, Brisbane, Qld. 4072, Australia
*To whom correspondence should be addressed.
| Abstract |
|---|
Motivation: Modeling transcriptional regulation using thermo-dynamic modeling approaches has become increasingly relevant as a way to gain a detailed understanding of transcriptional regulation. Thermodynamic models are able to model the interactions between transcription factors (TFs) and DNA that lead to a specific transcriptional output of the target gene. Such models can be trained by fitting their free parameters to data on the transcription rate of a gene and the concentrations of its regulating factors. However, the parameter fitting process is computationally very expensive and this limits the number of alternative types of model that can be explored.
Results: In this study, we evaluate the optimization landscape of a class of static, quantitative models of regulation and explore the efficiency of a range of optimization methods. We evaluate eight optimization methods: two variants of simulated annealing (SA), four variants of gradient descent (GD), a hybrid SA/GD algorithm and a genetic algorithm. We show that the optimization landscape has numerous local optima, resulting in poor performance for the GD methods. SA with a simple geometric cooling schedule performs best among all tested methods. In particular, we see no advantage to using the more sophisticated LAM cooling schedule. Overall, a good approximate solution is achievable in minutes using SA with a simple cooling schedule.
Contact: d.bauer{at}uq.edu.au; t.bailey{at}imb.uq.edu.au
Supplementary information: Supplementary data are available at Bioinformatics online.
Associate Editor: Olga Troyanskaya
Received on January 22, 2009; revised on March 31, 2009; accepted on April 21, 2009