Game Theoretic Algorithms for Protein-DNA Binding
Abstract
We develop and analyze game-theoretic algorithms for predicting coordinate binding of multiple DNA binding regulators. The allocation of proteins to local neighborhoods and to sites is carried out with resource constraints while explicating competing and coordinate binding relations among proteins with affinity to the site or region. The focus of this paper is on mathematical foundations of the approach. We also briefly demonstrate the approach in the context of the -phage switch.
Cite
Text
Pérez-breva et al. "Game Theoretic Algorithms for Protein-DNA Binding." Neural Information Processing Systems, 2006.Markdown
[Pérez-breva et al. "Game Theoretic Algorithms for Protein-DNA Binding." Neural Information Processing Systems, 2006.](https://mlanthology.org/neurips/2006/perezbreva2006neurips-game/)BibTeX
@inproceedings{perezbreva2006neurips-game,
title = {{Game Theoretic Algorithms for Protein-DNA Binding}},
author = {Pérez-breva, Luis and Ortiz, Luis E. and Yeang, Chen-hsiang and Jaakkola, Tommi S.},
booktitle = {Neural Information Processing Systems},
year = {2006},
pages = {1081-1088},
url = {https://mlanthology.org/neurips/2006/perezbreva2006neurips-game/}
}