<?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-22T12:36:35Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/1050" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/1050</identifier><datestamp>2017-03-21T19:28:12Z</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="79f0a5e9-9911-4e09-adf5-4d805c0ca296" confidence="600">Liang, Chengzhi</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-08-22T14:21:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2006-08-22T14:21:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en">2001</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted" lang="en">2001</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/1050</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Consensus pattern problem (CPP) aims at finding conserved regions, or motifs, in unaligned sequences.   This problem is NP-hard under various scoring schemes.  To solve this problem for protein sequences more efficiently,a new scoring scheme and a randomized algorithm based on substitution matrix are proposed here.  Any practical solutions to a bioinformatics problem must observe twoprinciples: (1) the problem that it solves accurately describes the real problem; in CPP, this requires the scoring scheme be able to distinguisha real motif from background; (2) it provides an efficient algorithmto solve the mathematical problem.  A key question in protein motif-finding is how to determine the motif length.  One problem in EM algorithms to solve CPP is how to find good startingpoints to reach the global optimum.  These two questions were both well addressed under this scoring scheme,which made the randomized algorithm both fast and accurate in practice.  A software, COPIA (COnsensus Pattern Identification and Analysis),has been developed implementing this algorithm.  Experiments using sequences from the von Willebrand factor (vWF)familyshowed that it worked well on finding multiple motifs and repeats.   COPIA&amp;apos;s ability to find repeats makes it also useful in illustrating the internal structures of multidomain proteins.   Comparative studies using several groups of protein sequences demonstrated that COPIA performed better than the commonly used motif-finding programs.</dim:field>
   <dim:field mdschema="dc" element="format" lang="en">application/pdf</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">439052 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: 2001, 
  Liang, Chengzhi. 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">bioinformatics software</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">multiple alignment</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">motif-finding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">consensus pattern problem</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">COPIA: A New Software for Finding Consensus Patterns in Unaligned Protein Sequences</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>