<?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-18T20:55:58Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/36789" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/36789</identifier><datestamp>2022-01-13T07:54:29Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</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">David Gifford.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Kumar, Rasika S</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">2007-03-12T17:53:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-03-12T17:53:53Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/36789</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">79624636</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (leaves 75-78).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This paper describes a method for finding multi-syllabic motifs in a genome. It expands on the algorithm developed by Takusagawa, et al[1, 2] that uses data from Chromatin Immuno-Precipitation (ChIP) experiments to isolate regions that have a given motif. The Takusagawa method uses an enumeration method to search for motifs in both positive and negative intergenic regions in order to determine the statistical significance of the results. Our algorithm also uses enumeration to find motifs that have gaps between the different sub-motifs, or syllables. This thesis also describes a method to calculate the significance of each motif and tests this method via Monte Carlo simulations on random test sets. The significant motifs found using this algorithm are verified against consensus motifs found in the literature.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Rasika S. Kumar.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">78 leaves</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">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">Multi-syllabic DNA motif discovery</dim:field>
   <dim:field mdschema="dc" element="title" qualifier="alternative" lang="en_US">Multi-syllabic deoxyribonucleic acid motif discovery</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="authorsordered">false</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="c1c79b34-1289-4283-b982-7ad7347002ae">
	&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>Multi-syllabic DNA motif discovery&lt;/Title>
   	&lt;Subtitle>Multi-syllabic deoxyribonucleic acid motif discovery&lt;/Subtitle>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2005&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Kumar, Rasika S&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 paper describes a method for finding multi-syllabic motifs in a genome. It expands on the algorithm developed by Takusagawa, et al[1, 2] that uses data from Chromatin Immuno-Precipitation (ChIP) experiments to isolate regions that have a given motif. The Takusagawa method uses an enumeration method to search for motifs in both positive and negative intergenic regions in order to determine the statistical significance of the results. Our algorithm also uses enumeration to find motifs that have gaps between the different sub-motifs, or syllables. This thesis also describes a method to calculate the significance of each motif and tests this method via Monte Carlo simulations on random test sets. The significant motifs found using this algorithm are verified against consensus motifs found in the literature.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>