<?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-09-21T18:44:38Z</responseDate><request verb="GetRecord" identifier="oai:openscholar.dut.ac.za:10321/1861" metadataPrefix="oai_dc">https://openscholar.dut.ac.za/server/oai/request</request><GetRecord><record><header><identifier>oai:openscholar.dut.ac.za:10321/1861</identifier><datestamp>2025-03-07T22:45:19Z</datestamp><setSpec>com_10321_9</setSpec><setSpec>col_10321_10</setSpec></header><metadata><oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
   <dc:title>Statistical pattern recognition based on LVQ artificial neural networks : application to TATA box motif</dc:title>
   <dc:creator>Wang, Haiyan</dc:creator>
   <dc:contributor>Bajic, Vladimir B.</dc:contributor>
   <dc:subject>Genetics</dc:subject>
   <dc:subject>Neural networks (Computer science)</dc:subject>
   <dc:subject>Human genome</dc:subject>
   <dc:subject>Information storage and retrieval systems</dc:subject>
   <dc:subject>Punched card systems</dc:subject>
   <dc:description>Dissertation submitted in compliance with the requirements for Masters Degree in Technology in the Department of Electrical Engineering (Light Current, Technikon Natal, Durban, South Africa, 2000.</dc:description>
   <dc:description>The computational analysis of eukaryotic promoters are among the most important and  complex research domains that may contribute to complete gene identification. The current  methods for promoter recognition are not sufficiently developed. Eukaryotic promoters contain  a number of short motifs that may be used in promoter recognition. Having good computational  models for these motifs can be crucial for increased efficiency of promoter recognition programs.  This study proposes a combined statistical and LVQ neural network system as a computational  model of the TAT A box motif of eukaryotic promoters. The methodology used is universal and  applicable to any short functional motif in DNA.  The statistical analysis of the core TAT A motif hexamer and its neighboring haxamers show  strong regularities that can be used in motif recognition. Moreover, the positional distribution  of the TAT A motif in terms of its distance from the transcription start site is very regular  and is used in the statistical modeling. Furthermore, the matching score of the position weight  matrix for the motif was used as a part of the model. Based on these statistical properties.  a novel LV Q classifier for TAT A motif recognition is developed. The characteristics of the  method are that the genetic algorithm was used for finding good initial weights of the LV Q  system, while fine tuning of two LVQ networks was done by the lvq? algorithm. The final  computational model is developed for a recognition level of 67.8o/c correct recognition on the  test set with less than 1% false recognition. This model is evaluated in the task of promoter  recognition on an independent test set. The results in promoter recognition outperform three  other promoter recognition programs. It is shown that the recognition of promoters based on  the recognition of the TAT A motifs using this new model is superior to the recognition based  on the currently used position weight matrix description of this motif.</dc:description>
   <dc:description>M</dc:description>
   <dc:date>2017-01-31T06:46:01Z</dc:date>
   <dc:date>2017-01-31T06:46:01Z</dc:date>
   <dc:date>2000</dc:date>
   <dc:type>Thesis</dc:type>
   <dc:identifier>124035</dc:identifier>
   <dc:identifier>http://hdl.handle.net/10321/1861</dc:identifier>
   <dc:identifier>https://doi.org/10.51415/10321/1861</dc:identifier>
   <dc:language>en</dc:language>
   <dc:format>120 p</dc:format>
   <dc:format>application/pdf</dc:format>
</oai_dc:dc></metadata></record></GetRecord></OAI-PMH>