<?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-21T00:53:12Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/22018" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/22018</identifier><datestamp>2026-09-24T00:58:29Z</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">Smyth, William F</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Golding, Brian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Islam, A S M Sohidull</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computational Engineering and Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2017-10-03T19:56:34Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2017-10-03T19:56:34Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017-11</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/22018</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/19011</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">A string is a sequence of symbols, usually called letters, drawn from some alphabet.&#xd;
It is one of the most fundamental and important structures in computing, bioinformatics and mathematics. Computer files, contents of a computer memory, network&#xd;
and satellite signals are all instances of strings. The genome of every living thing&#xd;
can be represented by a string drawn from the alphabet {a, c, g, t}. The algorithms&#xd;
processing strings have a wide range of applications such as information retrieval,&#xd;
search engines, data compression, cryptography and bioinformatics. In a DNA sequence the indeterminate symbol {a, c} is used when it is unclear whether a given nucleotide is a or c, We could then say that {a, c} matches&#xd;
another symbol {c, g} which in turn matches {g, t}, but {a, c} certainly does not&#xd;
match {g, t}. The processing of indeterminate strings is much more difficult because&#xd;
of this nontransitivity of matching. Thus a combinatorial understanding of indeterminate strings becomes essential to the development of efficient methods for their&#xd;
processing. With indeterminate strings, as with ordinary ones, the main task is the&#xd;
recognition/computation of patterns called regularities . We are particularly interested in regularities called repeats, whether tandem such as acgacg or nontandem&#xd;
(acgtacg). In this thesis we focus on newly-discovered regularities in strings, especially the enhanced cover array and the Lyndon array, with attention paid to extending the&#xd;
computations to indeterminate strings. Much of this work is necessarily abstract in&#xd;
nature, because the intention is to produce results that are applicable over a wide&#xd;
range of application areas. We will focus on finding algorithms to construct different&#xd;
data structures to represent strings such as cover arrays and Lyndon arrays. The&#xd;
idea of cover comes from strings which are not truly periodic but "almost" periodic&#xd;
in nature. For example abaababa is covered by aba but is not periodic. Similarly the&#xd;
Lyndon array describes the string in another unique way and is used in many fields of&#xd;
string algorithms. These data structures will help us in the field of string processing.&#xd;
As one application of these data structures we will work on "Reverse Engineering";&#xd;
that is, given data structures derived from of a string, how can we get the string back. Since DNA, RNA and peptide sequences are effectively "strings" with unique&#xd;
properties, we will adapt our algorithms for regular or indeterminate strings to these&#xd;
sequences. Sequence analysis can be used to assign function to genes and proteins&#xd;
by observing the similarities between the compared sequences. Identifying unusual&#xd;
repetitive patterns will aid in the identification of intrinsic features of the sequence&#xd;
such as active sites, gene-structures and regulatory elements. As an application of&#xd;
periodic strings we investigate microsatellites which are short repetitive DNA patterns where repeated substrings are of length 2 to 5. Microsatellites are used in a&#xd;
wide range of studies due to their small size and repetitive nature, and they have&#xd;
played an important role in the identification of numerous important genetic loci. A&#xd;
deeper understanding of the evolutionary and mutational properties of microsatellites&#xd;
is needed, not only to understand how the genome is organized, but also to correctly&#xd;
interpret and use microsatellite data in population genetics studies.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Repeats</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">String</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Bioinformatics</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Algorithm</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Repeats in Strings and Application in Bioinformatics</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>