• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Predi??o de promotores de Bacillus subtilis usando t?cnicas de aprendizado de m?quina

Monteiro, Meika Iwata 13 December 2005 (has links)
Made available in DSpace on 2014-12-17T14:56:02Z (GMT). No. of bitstreams: 1 MeikaIM.pdf: 766418 bytes, checksum: 87a604688aa5cd2c4f6aba8237c67210 (MD5) Previous issue date: 2005-12-13 / One of the most important goals of bioinformatics is the ability to identify genes in uncharacterized DNA sequences on world wide database. Gene expression on prokaryotes initiates when the RNA-polymerase enzyme interacts with DNA regions called promoters. In these regions are located the main regulatory elements of the transcription process. Despite the improvement of in vitro techniques for molecular biology analysis, characterizing and identifying a great number of promoters on a genome is a complex task. Nevertheless, the main drawback is the absence of a large set of promoters to identify conserved patterns among the species. Hence, a in silico method to predict them on any species is a challenge. Improved promoter prediction methods can be one step towards developing more reliable ab initio gene prediction methods. In this work, we present an empirical comparison of Machine Learning (ML) techniques such as Na??ve Bayes, Decision Trees, Support Vector Machines and Neural Networks, Voted Perceptron, PART, k-NN and and ensemble approaches (Bagging and Boosting) to the task of predicting Bacillus subtilis. In order to do so, we first built two data set of promoter and nonpromoter sequences for B. subtilis and a hybrid one. In order to evaluate of ML methods a cross-validation procedure is applied. Good results were obtained with methods of ML like SVM and Na?ve Bayes using B. subtilis. However, we have not reached good results on hybrid database / Um dos grandes desafios da Bioinform?tica ? manipular e analisar os dados acumulados nas bases de dados mundiais. A express?o dos genes em procariotos ? iniciada quando a enzima RNA polimerase une-se com uma regi?o pr?xima ao gene, chamada de promotor, onde ? localizado os principais elementos regulat?rios do processo de transcri??o. Apesar do crescente avan?o das t?cnicas experimentais (in vitro) em biologia molecular, caracterizar e identificar um n?mero significante de promotores ainda ? uma tarefa dif?cil. Os m?todos computacionais existentes enfrentam a falta de um n?mero adequado de promotores conhecidos para identificar padr?es conservados entre as esp?cies. Logo, um m?todo para prediz?-los em qualquer organismo procari?tico ainda ? um desafio. Neste trabalho, apresentamos uma compara??o emp?rica de t?cnicas individuais de aprendizado de m?quina, tais como: Classificador Bayesiano Ing?nuo, ?rvores de Decis?o, M?quinas de Vetores de Suporte, Redes Neurais do tipo VotedPerceptron, PART e k-Vizinhos Mais Pr?ximos e sistemas multiclassificadores (Bagging e Adaboosting) e Modelo Oculto de Markov ? tarefa de predi??o de promotores procariotos em Bacilos subtilis. Utilizamos a valida??o cruzada para avaliar todos os m?todos de AM. Para esses testes, foram constru?das base de dados com seq??ncias de promotores e n?o-promotores do Bacillus subtilis e uma base de dados h?brida. Os m?todos de AM obtiveram bons resultados com o SVM e o Na?ve Bayes. N?o conseguimos entretanto, obter resultados relevantes para a base de dados h?brida

Page generated in 0.1109 seconds