<?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-11-21T01:45:15Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/11286" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/11286</identifier><datestamp>2026-09-24T00:44:25Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</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">Franek, Frantisek</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Antoine Deza, Emil Sekerinski</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Antoine Deza, Emil Sekerinski</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Weng, Chia-Chun</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2014-06-18T16:54:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2014-06-18T16:54:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="created" lang="en_US">2011-09-23</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2011-10</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">opendissertations/6266</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">7252</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other" lang="en_US">2253075</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/11286</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/20105</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">&lt;p>In the first part of this thesis we present a C++ implementation of an improved O(n log n) algorithm to compute runs, number of primitively rooted distinct squares, and maximal repetitions, based on Crochemore's partitioning algorithm. This is a joint work with Mei Jiang and extends her work on the problem. In the second part we present a C++ implementation of a linear algorithm to compute runs based on the Main's, and Kolpakov and Kucherov's algorithms following the strategy:&lt;/p> &lt;p>1. Compute suffix array and LCP array in linear time;&lt;/p> &lt;p>2. Using the suffix array and LCP array, compute Lempel-Ziv factorization in linear time;&lt;/p> &lt;p>3. Using the Lempel-Ziv factorization, compute in linear time some of the runs that include all the leftmost runs following Main's algorithm;&lt;/p> &lt;p>4. Using Kolpakov and Kucherov's approach, compute in linear time the rest of all the runs.&lt;/p> &lt;p>For our linear time implementation, we partially relied on Jonathan Fischer's Java implementation.&lt;/p></dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">run</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">repetition</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">periodicity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">string</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Theory and Algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Theory and Algorithms</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Implementing Efficient Algorithms for Computing Runs</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>