<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T04:31:35Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/42057" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/42057</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131022</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Tommi Jaakkola.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Pérez-Breva, Luis</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-09-02T17:55:58Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-09-02T17:55:58Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2007</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/42057</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">231622280</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">This electronic version was submitted by the student author.  The certified thesis is available in the Institute Archives and Special Collections.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (p. 195-204).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This thesis develops a new scalable modeling framework at the interface of game theory and machine learning to recover economic structures from limited slices of data. Inference using economic models has broad applicability in machine learning. Economic structures underlie a surprisingly broad array of problems including signaling and molecular control in biology, drug development, neural structures, distributed control, recommender problems, social networking, as well as market dynamics. We demonstrate the framework with an application to genetic regulation. Genetic regulation determines how DNA is read and interpreted, is responsible for cell specialization, reaction to drugs, metabolism, etc. Improved understanding of regulation has potential to impact research on genetic diseases including cancer. Genetic regulation relies on coordinate binding of regulators along DNA. Understanding how binding arrangements are achieved and their effect on regulation is challenging since it is not always possible to study regulatory processes in isolation. Indeed, observing the action of regulators is an experimental and computational challenge. We need causal genome-wide models that can work with existing high-throughput observations. We abstract DNA binding as an economy and develop fast algorithms to predict average binding arrangements as competitive equilibria. The framework supports viewing regulation as a succession of regulatory states. We complete the framework with algorithms to infer causal structure from high-throughput observations. Learning here deviates from work in learning in games, it is closer to the economic theory of revealed preferences. Our algorithms predict the effect of experimental perturbations and can be used to refine experimental hypotheses. We show that the economic approach reproduces known behavior of a genetic switch (-phage), and that it can complete the map of coordinate binding in yeast.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Luis Pérez-Breva.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Ph.D.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">204 p.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by 
copyright. They may be viewed from this source for any purpose, but 
reproduction or distribution in any format is prohibited without written 
permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">DNA binding economies</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Deoxyribonucleic acid binding economies</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4617c12a-b06b-4e0f-8e84-4488c90ab83c">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>DNA binding economies&lt;/Title>
   	&lt;Subtitle>Deoxyribonucleic acid binding economies&lt;/Subtitle>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2007&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Pérez-Breva, Luis&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;Abstract>This thesis develops a new scalable modeling framework at the interface of game theory and machine learning to recover economic structures from limited slices of data. Inference using economic models has broad applicability in machine learning. Economic structures underlie a surprisingly broad array of problems including signaling and molecular control in biology, drug development, neural structures, distributed control, recommender problems, social networking, as well as market dynamics. We demonstrate the framework with an application to genetic regulation. Genetic regulation determines how DNA is read and interpreted, is responsible for cell specialization, reaction to drugs, metabolism, etc. Improved understanding of regulation has potential to impact research on genetic diseases including cancer. Genetic regulation relies on coordinate binding of regulators along DNA. Understanding how binding arrangements are achieved and their effect on regulation is challenging since it is not always possible to study regulatory processes in isolation. Indeed, observing the action of regulators is an experimental and computational challenge. We need causal genome-wide models that can work with existing high-throughput observations. We abstract DNA binding as an economy and develop fast algorithms to predict average binding arrangements as competitive equilibria. The framework supports viewing regulation as a succession of regulatory states. We complete the framework with algorithms to infer causal structure from high-throughput observations. Learning here deviates from work in learning in games, it is closer to the economic theory of revealed preferences. Our algorithms predict the effect of experimental perturbations and can be used to refine experimental hypotheses. We show that the economic approach reproduces known behavior of a genetic switch (-phage), and that it can complete the map of coordinate binding in yeast.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>