<?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-22T11:08:27Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4603" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4603</identifier><datestamp>2017-03-21T17:31:25Z</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" authority="9d49eb2b-d182-4c46-83c6-4018d8a91edc" confidence="600">Golod, Daniil</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-08-26T19:18:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-08-26T19:18:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2009-08-26T19:18:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2009-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4603</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Traditional algorithms for hidden Markov model decoding seek to maximize&#xd;
either the probability of a state path or the number of positions of a sequence&#xd;
assigned to the correct state. These algorithms provide only a single answer and&#xd;
in practice do not produce good results. The most mathematically sound of these&#xd;
algorithms is the Viterbi algorithm, which returns the state path that has the&#xd;
highest probability of generating a given sequence. Here, we explore an extension to&#xd;
this algorithm that allows us to ﬁnd the k paths of highest probabilities. The naive&#xd;
implementation of k best Viterbi paths is highly space-inefficient, so we adapt recent&#xd;
work on the Viterbi algorithm for a single path to this domain. Out algorithm uses&#xd;
much less memory than the naive approach. We then investigate the usefulness&#xd;
of the k best Viterbi paths on the example of transmembrane protein topology&#xd;
prediction. For membrane proteins, even simple path combination algorithms give&#xd;
good explanations, and if we look at the paths we are combining, we can give a&#xd;
sense of conﬁdence in the explanation as well. For proteins with two topologies,&#xd;
the k best paths can give insight into both correct explanations of a sequence, a&#xd;
feature lacking from traditional algorithms in this domain.</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="subject" lang="en">HMM</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">k-best paths</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">transmembrane topology</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">The k-best paths in Hidden Markov Models. Algorithms and Applications to Transmembrane  Protein Topology Recognition.</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master 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">Master of Mathematics</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>