Show simple item record

DNA Binding and Games

dc.date.accessioned2006-03-10T01:22:50Z
dc.date.accessioned2018-11-24T10:24:47Z
dc.date.available2006-03-10T01:22:50Z
dc.date.available2018-11-24T10:24:47Z
dc.date.issued2006-03-06
dc.identifier.urihttp://hdl.handle.net/1721.1/31311
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/31311
dc.description.abstractWe propose a game-theoretic approach tolearn and predict coordinate binding of multiple DNA bindingregulators. The framework implements resource constrainedallocation of proteins to local neighborhoods as well as to sitesthemselves, and explicates coordinate and competitive bindingrelations among proteins with affinity to the site or region. The focus of this paper is on mathematical foundationsof the new modeling approach. We demonstrate the approachin the context of the lambda-phage switch, a well-known biologicalsubsystem, and provide simulation results that successfully illustrate the predictions that can be derived from the modelwith known structure and affinities. Subsequentwork will elaborate on methods for learning the affinities and gamestructures from available binding data.
dc.format.extent11 p.
dc.format.extent15597128 bytes
dc.format.extent598367 bytes
dc.language.isoen_US
dc.titleDNA Binding and Games


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2006-018.pdf598.3Kbapplication/pdfView/Open
MIT-CSAIL-TR-2006-018.ps15.59Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record