<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.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-20T23:55:47Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/104916" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/104916</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>El-Kebir, Mohammed</dc:contributor>
          <dc:creator>Xie, Shunping</dc:creator>
          <dc:date>2019-08-23T20:01:16Z</dc:date>
          <dc:date>2019-08-23T20:01:16Z</dc:date>
          <dc:date>2019-04-25</dc:date>
          <dc:date>2019-05</dc:date>
          <dc:description>Cancer cells may mutate multiple times, from a normal state to a mutated state and vice versa. Given our sequenced data, we can model the mutation process with a phylogenetic tree. One representative model is the k-Dollo parsimony, where all observed mutations mutate from a single normal cell and each character of a cell is gained at most once and lost at most k times. We examine the 1-Dollo Phylogeny problem, does a 1-Dollo phylogeny, a tree that follows the 1-Dollo parsimony model, exist for the observations.
Current algorithms to solve the 1-Dollo Phylogeny problem only tell us whether or not a set of observations has a 1-Dollo phylogeny by outputting a single solution. We explore the structure of 1-Dollo phylogenies and use our idea of a skeleton to develop an algorithm that enumerates all 1-Dollo phylogenies for any set of observations. This algorithm runs much faster than the naive brute force enumeration algorithm for random input. The implementation is here: https://github.com/sxie12/skeleton_solver.</dc:description>
          <dc:description>Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2019-08-22 without embargo terms</dc:description>
          <dc:description>The student, Shunping Xie, accepted the attached license on 2019-04-24 at 15:15.</dc:description>
          <dc:description>The student, Shunping Xie, submitted this Thesis for approval on 2019-04-24 at 15:17.</dc:description>
          <dc:description>This Thesis was approved for publication on 2019-04-25 at 07:39.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #13858 on 2019-08-22 at 14:46:21</dc:description>
          <dc:description>Made available in DSpace on 2019-08-23T20:01:16Z (GMT). No. of bitstreams: 2
XIE-THESIS-2019.pdf: 256136 bytes, checksum: d73d3f572be5eb7ed12c98e587f914c3 (MD5)
LICENSE.txt: 4209 bytes, checksum: 9b3adbf48f426e8d4bb726d4c71f9722 (MD5)
  Previous issue date: 2019-04-25</dc:description>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://hdl.handle.net/2142/104916</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2019 Shunping Xie</dc:rights>
          <dc:subject>1-Dollo phylogeny</dc:subject>
          <dc:subject>Skeleton</dc:subject>
          <dc:subject>Enumeration algorithm</dc:subject>
          <dc:title>Towards characterizing the solution space of the 1-Dollo Phylogeny problem</dc:title>
          <dc:type>text</dc:type>
          <dc:type>text</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
