Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis

Detalhes bibliográficos
Autor(a) principal: Pereira, Gean Trindade
Data de Publicação: 2018
Tipo de documento: Dissertação
Idioma: por
Título da fonte: Repositório Institucional da UFSCAR
Texto Completo: https://repositorio.ufscar.br/handle/ufscar/10977
Resumo: In Machine Learning (ML), commonly a classification problem consists of associating an instance to only one class within an usually small number of classes. However, there are more complex problems involving dozens and even hundreds of classes arranged in a hierarchical structure, which are known in the literature as Hierarchical Classification (HC) problems. In these problems, an instance is assigned not only to one class but also to its superclasses, and two approaches called Global and Local are often used in HC. In the Local Approach, multiple classifiers are trained using local information from classes, while in the Global Approach a single classifier is induced to deal with the entire class hierarchy, which makes it more interpretable. One of the fields of greatest application of HC is Bioinformatics, where tools that explore hierarchical relationships in data and/or made use of ML are still scarce. In addition, an issue that is important for both Bioinformatics and HC fields, and which is not always given due attention, is the interpretability of the models. In the context of Bioinformatics, a topic that is gaining attention is the study and classification of Transposable Elements (TEs), which are DNA fragments capable of moving inside the genome of their hosts. According to recent research, TEs are responsible for mutations in several organisms, including the human genome, which guaranteed them the nickname of great responsible for the genetic variability of species. In this work, three global methods based on Genetic Algorithms that evolve classification rules applied to HC of TEs were proposed and investigated, and in two of them, Multi-Objective Approaches were implemented in order to better deal with the predictive performance and interpretability objectives. The first one is a traditional optimization method called Hierarchical Classification with a Genetic Algorithm (HC-GA), which was used as the basis for the development of the others. The second method is called Hierarchical Classification with a Weighted Genetic Algorithm (HC-WGA), and implements the Weighted Sum Approach. The third method is called Hierarchical Classification with a Lexicographic Genetic Algorithm (HC-LGA), which follows the Lexicographic Approach. Experiments with the TEs class taxonomy developed by Wicker et al. (2007), have shown that the proposed methods have achieved better or competitive results with the state-of-the-art HC methods from the literature, with the advantage of generating interpretable rule models. When compared to the popular global method Clus-HMC, the proposed methods presented better predictive performance in addition to producing less rules with a fewer tests. In the comparisons with the homology tools BLASTn and RepeatMasker, the hierarchical methods achieved superior results in both datasets and were able to classify all the instances, different from what occurred in those tools. Moreover, it was verified that the two multi-objective methods not only obtained the best results for the two datasets used but they also surpassed the simple optimization method with statistical significance.
id SCAR_d54202146609b45170eae87d7562fa16
oai_identifier_str oai:repositorio.ufscar.br:ufscar/10977
network_acronym_str SCAR
network_name_str Repositório Institucional da UFSCAR
repository_id_str 4322
spelling Pereira, Gean TrindadeCerri, Ricardohttp://lattes.cnpq.br/6266519868438512http://lattes.cnpq.br/3765060702388111ca0fc033-3734-49b4-8e18-d666217d914f2019-02-14T18:40:05Z2019-02-14T18:40:05Z2018-11-09PEREIRA, Gean Trindade. Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis. 2018. Dissertação (Mestrado em Ciência da Computação) – Universidade Federal de São Carlos, São Carlos, 2018. Disponível em: https://repositorio.ufscar.br/handle/ufscar/10977.https://repositorio.ufscar.br/handle/ufscar/10977In Machine Learning (ML), commonly a classification problem consists of associating an instance to only one class within an usually small number of classes. However, there are more complex problems involving dozens and even hundreds of classes arranged in a hierarchical structure, which are known in the literature as Hierarchical Classification (HC) problems. In these problems, an instance is assigned not only to one class but also to its superclasses, and two approaches called Global and Local are often used in HC. In the Local Approach, multiple classifiers are trained using local information from classes, while in the Global Approach a single classifier is induced to deal with the entire class hierarchy, which makes it more interpretable. One of the fields of greatest application of HC is Bioinformatics, where tools that explore hierarchical relationships in data and/or made use of ML are still scarce. In addition, an issue that is important for both Bioinformatics and HC fields, and which is not always given due attention, is the interpretability of the models. In the context of Bioinformatics, a topic that is gaining attention is the study and classification of Transposable Elements (TEs), which are DNA fragments capable of moving inside the genome of their hosts. According to recent research, TEs are responsible for mutations in several organisms, including the human genome, which guaranteed them the nickname of great responsible for the genetic variability of species. In this work, three global methods based on Genetic Algorithms that evolve classification rules applied to HC of TEs were proposed and investigated, and in two of them, Multi-Objective Approaches were implemented in order to better deal with the predictive performance and interpretability objectives. The first one is a traditional optimization method called Hierarchical Classification with a Genetic Algorithm (HC-GA), which was used as the basis for the development of the others. The second method is called Hierarchical Classification with a Weighted Genetic Algorithm (HC-WGA), and implements the Weighted Sum Approach. The third method is called Hierarchical Classification with a Lexicographic Genetic Algorithm (HC-LGA), which follows the Lexicographic Approach. Experiments with the TEs class taxonomy developed by Wicker et al. (2007), have shown that the proposed methods have achieved better or competitive results with the state-of-the-art HC methods from the literature, with the advantage of generating interpretable rule models. When compared to the popular global method Clus-HMC, the proposed methods presented better predictive performance in addition to producing less rules with a fewer tests. In the comparisons with the homology tools BLASTn and RepeatMasker, the hierarchical methods achieved superior results in both datasets and were able to classify all the instances, different from what occurred in those tools. Moreover, it was verified that the two multi-objective methods not only obtained the best results for the two datasets used but they also surpassed the simple optimization method with statistical significance.Em Aprendizado de Máquina (no inglês, Machine Learning (ML)), comumente um problema de classificação consiste em associar uma instância a apenas uma classe dentre um número normalmente pequeno de classes. Entretanto, existem problemas mais complexos que envolvem dezenas e até centenas de classes arranjadas numa estrutura hierárquica, sendo conhecidos na literatura como problemas de Classificação Hierárquica (no inglês, Hierarchical Classification (HC)). Nesses, uma instância é assinalada não só a uma classe, mas também as suas superclasses, e duas abordagens chamadas Global e Local são frequentemente utilizadas para tratá-los. Na Abordagem Local, múltiplos classificadores são treinados usando informações locais das classes, enquanto que na Abordagem Global um único classificador é induzido para lidar com toda a hierarquia de classes, o que a torna mais interpretável. Uma das áreas de maior aplicação da HC é a Bioinformática, onde ferramentas que exploram as relações hierárquicas nos dados e/ou que fazem uso de ML ainda são escassas. Além disso, uma questão importante em ambos os domínios e que ainda não recebe a devida atenção, é a interpretabilidade dos modelos. No contexto da Bioinformática, um tema que vem ganhando relevância é o estudo e classificação dos Elementos Transponíveis (no inglês, Transposable Elements (TEs)), fragmentos de DNA que se movem dentro do genoma de seus hospedeiros. Segundo pesquisas recentes, os TEs são responsáveis por mutações em diversos organismos, inclusive no genoma humano, o que lhes garantiu a alcunha de grandes responsáveis pela variabilidade genética das espécies. Nesse trabalho são propostos e investigados três métodos globais baseados em Algoritmos Genéticos que evoluem regras de classificação aplicadas a HC de TEs, sendo que em dois deles foram implementadas Abordagens Multiobjetivo com o intuito de lidar melhor com os objetivos de desempenho preditivo e interpretabilidade. O primeiro trata-se de um método de otimização simples chamado Hierarchical Classification with a Genetic Algorithm (HC-GA), o qual serviu de base para o desenvolvimento dos demais. O segundo método é denominado Hierarchical Classification with a Weighted Genetic Algorithm (HC-WGA), e implementa a Abordagem de Soma Ponderada. O terceiro método é chamado Hierarchical Classification with a Lexicographic Genetic Algorithm (HC-LGA), e segue a Abordagem Lexicográfica. Experimentos com a taxonomia de classes de TEs desenvolvida por Wicker et al. (2007), mostraram que os métodos propostos atingiram resultados superiores ou competitivos com os métodos de HC estado-da-arte da literatura, com a vantagem de que induzem modelos interpretáveis de regras. Quando comparados ao popular método global Clus-HMC, os métodos propostos apresentaram melhor desempenho além de produzirem regras menores e em menor quantidade. Nas comparações comas ferramentas de homologia BLASTn e RepeatMasker, os métodos hierárquicos alcançaram resultados superiores em ambos os conjuntos de dados e foram capazes de classificar todas as instâncias, diferente do que ocorreu nessas ferramentas. Ademais, foi verificado que os dois métodos multiobjetivo não só geraram os melhores resultados para os dois conjuntos de dados como também superaram com significância estatística o método de otimização simples.Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)CAPES: Código de Financiamento 001porUniversidade Federal de São CarlosCâmpus São CarlosPrograma de Pós-Graduação em Ciência da Computação - PPGCCUFSCarAprendizado de máquinaClassificação hierárquicaAlgoritmos genéticosOtimização multiobjetivoElementos transponíveisMachine learningHierarchical classificationGenetic algorithmsMulti-objective optimizationTransposable elementsCIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAOCIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAOAlgoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveisinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisOnline600600c997f5ee-db84-40ed-8971-521dd105f2d1info:eu-repo/semantics/openAccessreponame:Repositório Institucional da UFSCARinstname:Universidade Federal de São Carlos (UFSCAR)instacron:UFSCARORIGINALDissertacaoMestradoFinal.pdfDissertacaoMestradoFinal.pdfDissertação de Mestrado versão final corrigidaapplication/pdf5942890https://repositorio.ufscar.br/bitstream/ufscar/10977/1/DissertacaoMestradoFinal.pdffd3d9b91c8c01ee89f5268214f20166fMD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81957https://repositorio.ufscar.br/bitstream/ufscar/10977/2/license.txtae0398b6f8b235e40ad82cba6c50031dMD52TEXTDissertacaoMestradoFinal.pdf.txtDissertacaoMestradoFinal.pdf.txtExtracted texttext/plain286725https://repositorio.ufscar.br/bitstream/ufscar/10977/3/DissertacaoMestradoFinal.pdf.txt6fef9df612bc6382874d740edd40c827MD53THUMBNAILDissertacaoMestradoFinal.pdf.jpgDissertacaoMestradoFinal.pdf.jpgIM Thumbnailimage/jpeg8582https://repositorio.ufscar.br/bitstream/ufscar/10977/4/DissertacaoMestradoFinal.pdf.jpgaeeab8bbce15fe03e90df3e15fe6e2b5MD54ufscar/109772023-09-18 18:31:18.096oai:repositorio.ufscar.br:ufscar/10977TElDRU7Dh0EgREUgRElTVFJJQlVJw4fDg08gTsODTy1FWENMVVNJVkEKCkNvbSBhIGFwcmVzZW50YcOnw6NvIGRlc3RhIGxpY2Vuw6dhLCB2b2PDqiAobyBhdXRvciAoZXMpIG91IG8gdGl0dWxhciBkb3MgZGlyZWl0b3MgZGUgYXV0b3IpIGNvbmNlZGUgw6AgVW5pdmVyc2lkYWRlCkZlZGVyYWwgZGUgU8OjbyBDYXJsb3MgbyBkaXJlaXRvIG7Do28tZXhjbHVzaXZvIGRlIHJlcHJvZHV6aXIsICB0cmFkdXppciAoY29uZm9ybWUgZGVmaW5pZG8gYWJhaXhvKSwgZS9vdQpkaXN0cmlidWlyIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyAoaW5jbHVpbmRvIG8gcmVzdW1vKSBwb3IgdG9kbyBvIG11bmRvIG5vIGZvcm1hdG8gaW1wcmVzc28gZSBlbGV0csO0bmljbyBlCmVtIHF1YWxxdWVyIG1laW8sIGluY2x1aW5kbyBvcyBmb3JtYXRvcyDDoXVkaW8gb3UgdsOtZGVvLgoKVm9jw6ogY29uY29yZGEgcXVlIGEgVUZTQ2FyIHBvZGUsIHNlbSBhbHRlcmFyIG8gY29udGXDumRvLCB0cmFuc3BvciBhIHN1YSB0ZXNlIG91IGRpc3NlcnRhw6fDo28KcGFyYSBxdWFscXVlciBtZWlvIG91IGZvcm1hdG8gcGFyYSBmaW5zIGRlIHByZXNlcnZhw6fDo28uCgpWb2PDqiB0YW1iw6ltIGNvbmNvcmRhIHF1ZSBhIFVGU0NhciBwb2RlIG1hbnRlciBtYWlzIGRlIHVtYSBjw7NwaWEgYSBzdWEgdGVzZSBvdQpkaXNzZXJ0YcOnw6NvIHBhcmEgZmlucyBkZSBzZWd1cmFuw6dhLCBiYWNrLXVwIGUgcHJlc2VydmHDp8Ojby4KClZvY8OqIGRlY2xhcmEgcXVlIGEgc3VhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyDDqSBvcmlnaW5hbCBlIHF1ZSB2b2PDqiB0ZW0gbyBwb2RlciBkZSBjb25jZWRlciBvcyBkaXJlaXRvcyBjb250aWRvcwpuZXN0YSBsaWNlbsOnYS4gVm9jw6ogdGFtYsOpbSBkZWNsYXJhIHF1ZSBvIGRlcMOzc2l0byBkYSBzdWEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvIG7Do28sIHF1ZSBzZWphIGRlIHNldQpjb25oZWNpbWVudG8sIGluZnJpbmdlIGRpcmVpdG9zIGF1dG9yYWlzIGRlIG5pbmd1w6ltLgoKQ2FzbyBhIHN1YSB0ZXNlIG91IGRpc3NlcnRhw6fDo28gY29udGVuaGEgbWF0ZXJpYWwgcXVlIHZvY8OqIG7Do28gcG9zc3VpIGEgdGl0dWxhcmlkYWRlIGRvcyBkaXJlaXRvcyBhdXRvcmFpcywgdm9jw6oKZGVjbGFyYSBxdWUgb2J0ZXZlIGEgcGVybWlzc8OjbyBpcnJlc3RyaXRhIGRvIGRldGVudG9yIGRvcyBkaXJlaXRvcyBhdXRvcmFpcyBwYXJhIGNvbmNlZGVyIMOgIFVGU0NhcgpvcyBkaXJlaXRvcyBhcHJlc2VudGFkb3MgbmVzdGEgbGljZW7Dp2EsIGUgcXVlIGVzc2UgbWF0ZXJpYWwgZGUgcHJvcHJpZWRhZGUgZGUgdGVyY2Vpcm9zIGVzdMOhIGNsYXJhbWVudGUKaWRlbnRpZmljYWRvIGUgcmVjb25oZWNpZG8gbm8gdGV4dG8gb3Ugbm8gY29udGXDumRvIGRhIHRlc2Ugb3UgZGlzc2VydGHDp8OjbyBvcmEgZGVwb3NpdGFkYS4KCkNBU08gQSBURVNFIE9VIERJU1NFUlRBw4fDg08gT1JBIERFUE9TSVRBREEgVEVOSEEgU0lETyBSRVNVTFRBRE8gREUgVU0gUEFUUk9Dw41OSU8gT1UKQVBPSU8gREUgVU1BIEFHw4pOQ0lBIERFIEZPTUVOVE8gT1UgT1VUUk8gT1JHQU5JU01PIFFVRSBOw4NPIFNFSkEgQSBVRlNDYXIsClZPQ8OKIERFQ0xBUkEgUVVFIFJFU1BFSVRPVSBUT0RPUyBFIFFVQUlTUVVFUiBESVJFSVRPUyBERSBSRVZJU8ODTyBDT01PClRBTULDiU0gQVMgREVNQUlTIE9CUklHQcOHw5VFUyBFWElHSURBUyBQT1IgQ09OVFJBVE8gT1UgQUNPUkRPLgoKQSBVRlNDYXIgc2UgY29tcHJvbWV0ZSBhIGlkZW50aWZpY2FyIGNsYXJhbWVudGUgbyBzZXUgbm9tZSAocykgb3UgbyhzKSBub21lKHMpIGRvKHMpCmRldGVudG9yKGVzKSBkb3MgZGlyZWl0b3MgYXV0b3JhaXMgZGEgdGVzZSBvdSBkaXNzZXJ0YcOnw6NvLCBlIG7Do28gZmFyw6EgcXVhbHF1ZXIgYWx0ZXJhw6fDo28sIGFsw6ltIGRhcXVlbGFzCmNvbmNlZGlkYXMgcG9yIGVzdGEgbGljZW7Dp2EuCg==Repositório InstitucionalPUBhttps://repositorio.ufscar.br/oai/requestopendoar:43222023-09-18T18:31:18Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)false
dc.title.por.fl_str_mv Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis
title Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis
spellingShingle Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis
Pereira, Gean Trindade
Aprendizado de máquina
Classificação hierárquica
Algoritmos genéticos
Otimização multiobjetivo
Elementos transponíveis
Machine learning
Hierarchical classification
Genetic algorithms
Multi-objective optimization
Transposable elements
CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO
CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
title_short Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis
title_full Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis
title_fullStr Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis
title_full_unstemmed Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis
title_sort Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis
author Pereira, Gean Trindade
author_facet Pereira, Gean Trindade
author_role author
dc.contributor.authorlattes.por.fl_str_mv http://lattes.cnpq.br/3765060702388111
dc.contributor.author.fl_str_mv Pereira, Gean Trindade
dc.contributor.advisor1.fl_str_mv Cerri, Ricardo
dc.contributor.advisor1Lattes.fl_str_mv http://lattes.cnpq.br/6266519868438512
dc.contributor.authorID.fl_str_mv ca0fc033-3734-49b4-8e18-d666217d914f
contributor_str_mv Cerri, Ricardo
dc.subject.por.fl_str_mv Aprendizado de máquina
Classificação hierárquica
Algoritmos genéticos
Otimização multiobjetivo
Elementos transponíveis
topic Aprendizado de máquina
Classificação hierárquica
Algoritmos genéticos
Otimização multiobjetivo
Elementos transponíveis
Machine learning
Hierarchical classification
Genetic algorithms
Multi-objective optimization
Transposable elements
CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO
CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
dc.subject.eng.fl_str_mv Machine learning
Hierarchical classification
Genetic algorithms
Multi-objective optimization
Transposable elements
dc.subject.cnpq.fl_str_mv CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::METODOLOGIA E TECNICAS DA COMPUTACAO
CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
description In Machine Learning (ML), commonly a classification problem consists of associating an instance to only one class within an usually small number of classes. However, there are more complex problems involving dozens and even hundreds of classes arranged in a hierarchical structure, which are known in the literature as Hierarchical Classification (HC) problems. In these problems, an instance is assigned not only to one class but also to its superclasses, and two approaches called Global and Local are often used in HC. In the Local Approach, multiple classifiers are trained using local information from classes, while in the Global Approach a single classifier is induced to deal with the entire class hierarchy, which makes it more interpretable. One of the fields of greatest application of HC is Bioinformatics, where tools that explore hierarchical relationships in data and/or made use of ML are still scarce. In addition, an issue that is important for both Bioinformatics and HC fields, and which is not always given due attention, is the interpretability of the models. In the context of Bioinformatics, a topic that is gaining attention is the study and classification of Transposable Elements (TEs), which are DNA fragments capable of moving inside the genome of their hosts. According to recent research, TEs are responsible for mutations in several organisms, including the human genome, which guaranteed them the nickname of great responsible for the genetic variability of species. In this work, three global methods based on Genetic Algorithms that evolve classification rules applied to HC of TEs were proposed and investigated, and in two of them, Multi-Objective Approaches were implemented in order to better deal with the predictive performance and interpretability objectives. The first one is a traditional optimization method called Hierarchical Classification with a Genetic Algorithm (HC-GA), which was used as the basis for the development of the others. The second method is called Hierarchical Classification with a Weighted Genetic Algorithm (HC-WGA), and implements the Weighted Sum Approach. The third method is called Hierarchical Classification with a Lexicographic Genetic Algorithm (HC-LGA), which follows the Lexicographic Approach. Experiments with the TEs class taxonomy developed by Wicker et al. (2007), have shown that the proposed methods have achieved better or competitive results with the state-of-the-art HC methods from the literature, with the advantage of generating interpretable rule models. When compared to the popular global method Clus-HMC, the proposed methods presented better predictive performance in addition to producing less rules with a fewer tests. In the comparisons with the homology tools BLASTn and RepeatMasker, the hierarchical methods achieved superior results in both datasets and were able to classify all the instances, different from what occurred in those tools. Moreover, it was verified that the two multi-objective methods not only obtained the best results for the two datasets used but they also surpassed the simple optimization method with statistical significance.
publishDate 2018
dc.date.issued.fl_str_mv 2018-11-09
dc.date.accessioned.fl_str_mv 2019-02-14T18:40:05Z
dc.date.available.fl_str_mv 2019-02-14T18:40:05Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
status_str publishedVersion
dc.identifier.citation.fl_str_mv PEREIRA, Gean Trindade. Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis. 2018. Dissertação (Mestrado em Ciência da Computação) – Universidade Federal de São Carlos, São Carlos, 2018. Disponível em: https://repositorio.ufscar.br/handle/ufscar/10977.
dc.identifier.uri.fl_str_mv https://repositorio.ufscar.br/handle/ufscar/10977
identifier_str_mv PEREIRA, Gean Trindade. Algoritmos genéticos multiobjetivo para classificação hierárquica de elementos transponíveis. 2018. Dissertação (Mestrado em Ciência da Computação) – Universidade Federal de São Carlos, São Carlos, 2018. Disponível em: https://repositorio.ufscar.br/handle/ufscar/10977.
url https://repositorio.ufscar.br/handle/ufscar/10977
dc.language.iso.fl_str_mv por
language por
dc.relation.confidence.fl_str_mv 600
600
dc.relation.authority.fl_str_mv c997f5ee-db84-40ed-8971-521dd105f2d1
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Universidade Federal de São Carlos
Câmpus São Carlos
dc.publisher.program.fl_str_mv Programa de Pós-Graduação em Ciência da Computação - PPGCC
dc.publisher.initials.fl_str_mv UFSCar
publisher.none.fl_str_mv Universidade Federal de São Carlos
Câmpus São Carlos
dc.source.none.fl_str_mv reponame:Repositório Institucional da UFSCAR
instname:Universidade Federal de São Carlos (UFSCAR)
instacron:UFSCAR
instname_str Universidade Federal de São Carlos (UFSCAR)
instacron_str UFSCAR
institution UFSCAR
reponame_str Repositório Institucional da UFSCAR
collection Repositório Institucional da UFSCAR
bitstream.url.fl_str_mv https://repositorio.ufscar.br/bitstream/ufscar/10977/1/DissertacaoMestradoFinal.pdf
https://repositorio.ufscar.br/bitstream/ufscar/10977/2/license.txt
https://repositorio.ufscar.br/bitstream/ufscar/10977/3/DissertacaoMestradoFinal.pdf.txt
https://repositorio.ufscar.br/bitstream/ufscar/10977/4/DissertacaoMestradoFinal.pdf.jpg
bitstream.checksum.fl_str_mv fd3d9b91c8c01ee89f5268214f20166f
ae0398b6f8b235e40ad82cba6c50031d
6fef9df612bc6382874d740edd40c827
aeeab8bbce15fe03e90df3e15fe6e2b5
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
repository.name.fl_str_mv Repositório Institucional da UFSCAR - Universidade Federal de São Carlos (UFSCAR)
repository.mail.fl_str_mv
_version_ 1802136349629743104