<?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-19T01:49:09Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/150079" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/150079</identifier><datestamp>2023-04-01T03:25:54Z</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">Berger, Bonnie</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Kim, Younhun</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Mathematics</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2023-03-31T14:30:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-03-31T14:30:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2023-02</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2023-01-17T16:24:31.525Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1721.1/150079</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="orcid">https://orcid.org/0000-0001-8341-9816</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">In this thesis, we study several problems related to computational biology surrounding a central theme: inferring temporally-spaced events using noisy measurements. The first half studies two theoretical problems for explaining the history of human populations at different scales. First, we present sample complexity results for learning population structures given pairwise coalescence data. The second involves pedigree reconstruction, in which we prove that there is a sample-efficient algorithm for reconstructing a “family tree” given a population-wide collection of genomic information.&#xd;
&#xd;
The second half of the thesis concerns models for the microbiome and practical algorithms that emphasize scalability and interpretability. We present work on strain tracking, in which one is asked to reconstruct a time-series profile of bacterial strain ratios from shotgun-sequenced reads. We state an algorithm designed to scale on large data, discuss some real-world considerations that makes the problem particularly challenging, and present empirical results. Last but not least, we present collaborative work on dynamical systems modeling of the microbiome, in which we discuss how one can learn a large, yet interpretable, Lotka-Volterra model from time-series measurements of the microbiome.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree">Ph.D.</dim:field>
   <dim:field mdschema="dc" element="publisher">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights">In Copyright - Educational Use Permitted</dim:field>
   <dim:field mdschema="dc" element="rights">Copyright MIT</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri">http://rightsstatements.org/page/InC-EDU/1.0/</dim:field>
   <dim:field mdschema="dc" element="title">Algorithms for Reconstructing Biological History from Genomic Data</dim:field>
   <dim:field mdschema="dc" element="type">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="mit" element="thesis" qualifier="degree">Doctoral</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Doctor of Philosophy</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="a6471faf-7bb5-4a0c-bc43-caf3436cf508">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
   	&lt;Title>Algorithms for Reconstructing Biological History from Genomic Data&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2023-02&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Kim, Younhun&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://rightsstatements.org/page/InC-EDU/1.0/&lt;/License>
   	&lt;Abstract>In this thesis, we study several problems related to computational biology surrounding a central theme: inferring temporally-spaced events using noisy measurements. The first half studies two theoretical problems for explaining the history of human populations at different scales. First, we present sample complexity results for learning population structures given pairwise coalescence data. The second involves pedigree reconstruction, in which we prove that there is a sample-efficient algorithm for reconstructing a “family tree” given a population-wide collection of genomic information.&#xd;
&#xd;
The second half of the thesis concerns models for the microbiome and practical algorithms that emphasize scalability and interpretability. We present work on strain tracking, in which one is asked to reconstruct a time-series profile of bacterial strain ratios from shotgun-sequenced reads. We state an algorithm designed to scale on large data, discuss some real-world considerations that makes the problem particularly challenging, and present empirical results. Last but not least, we present collaborative work on dynamical systems modeling of the microbiome, in which we discuss how one can learn a large, yet interpretable, Lotka-Volterra model from time-series measurements of the microbiome.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>