Optimization based clustering and classification algorithms in analysis of microarray gene expression data sets
Year: 2007
Type: dissertation
Abstract: Bioinformatics and computational biology are relatively new areas that involve the use of different techniques including computer science, informatics, biochemistry, applied math and etc., to solve biological problems.In recent years the development of new molecular genetics technologies, such as DNA microarrays led to the simultaneous measurement of expression levels of thousands and even tens of thousands of genes.Microarray gene expression technology has facilitated the study of genomic structure and investigation of biological systems.Numerical output of this technology is shown as microarray gene expression data sets.These data sets contain a very large number of genes and a relatively small number of samples and their precise analysis requires a robust and suitable computer software.Due to this, only a few existing algorithms are applicable to them, so more efficient methods for solving clustering, gene selection and classification problems of gene expression data sets are required and those methods need to be computationally applicable and less expensive.The aim of this thesis is to develop new algorithms for solving clustering, gene selection and data classification problems on gene expression data sets.Clustering in gene expression data sets is a challenging problem.The increasing use of DNA microarray-based tumour gene expression profiles for cancer diagnosis requires more efficient methods to solve clustering problems of these profiles.Different algorithms for clustering of genes have been proposed, however few algorithms can be applied to the clustering of samples.k-means algorithm, among very few clustering algorithms is applicable to microarray gene expression data sets, however these are not efficient for solving clustering problems when the number of genes is thousands and this algorithm is very sensitive to the choice of a starting point.Additionally, when the number of clusters is relatively large, this algorithm gives local minima which can differ significantly from the global solution.Over the last several years different approaches have been proposed to improve global ii
Author: Karim Mardaneh
Institution: Federation University
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: green
OpenAlex ID: W2738748219
