<?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-22T22:29:46Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1191" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1191</identifier><datestamp>2017-03-21T19:29:09Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en" authority="da3cc8ea-32f7-42c6-bdaa-aab24503097f" confidence="600">Vinar, Tomas</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:21:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:21:16Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2005</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1191</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this thesis, we present enhancements of hidden Markov models for  the problem of finding genes in DNA sequences.   Genes are the parts of  DNA that serve as a template for synthesis of proteins.   Thus, gene  finding is a crucial step in the analysis of DNA sequencing data.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  Hidden Markov models are a key tool used in gene finding.   Yhis  thesis presents three methods for extending the capabilities of hidden  Markov models to better capture the statistical properties of DNA  sequences.   In all three, we encounter limiting factors that lead to  trade-offs between the model accuracy and  those limiting factors.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  First, we build better models for recognizing biological  signals in DNA sequences.   Our new models capture  non-adjacent dependencies within  these signals.   In this case, the main limiting factor is the amount of  training data: more training data allows more complex models.    Second, we design methods for better representation of length  distributions in hidden Markov models, where we balance the accuracy  of the representation against the running time needed to find  genes in novel sequences.   Finally, we show that creating hidden Markov  models with complex topologies may be detrimental to the prediction  accuracy, unless we use more complex prediction algorithms.    However, such algorithms require longer running time, and  in many cases the prediction problem is NP-hard.   For gene finding this means  that incorporating some of the prior biological knowledge into the  model would require impractical running times.   However, we also  demonstrate that our methods can be used for solving  other biological problems, where input sequences are short.    &amp;lt;br /&amp;gt;&amp;lt;br /&amp;gt;  As a model example to evaluate our methods, we built a gene finder  ExonHunter that outperforms programs commonly used in genome projects.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">1509842 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en">Copyright: 2005, 
  Vinar, Tomas. All rights reserved.</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">gene finding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">hidden Markov models</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">probabilistic modeling</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Enhancements to Hidden Markov Models for Gene Finding and Other Biological Applications</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>