Biclustering analysis of gene expression data using evolutionary algorithms
File version
Author(s)
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
H. Iba and N. Noman
Date
Size
File type(s)
Location
License
Abstract
Bicluster analysis has emerged as a powerful tool for unsupervised pattern discovery, especially for the analysis of gene expression data. This chapter discusses the biclustering problem, the different bicluster patterns, existing biclustering techniques, and how evolutionary algorithms (EAs) have been applied to solve the biclustering problem. Gene ontology (GO), metabolic pathway maps (MPMs), and protein-protein interaction (PPI) networks can be used to determine the biological functional relevance of genes and conditions in a bicluster. Many biclustering algorithms have been proposed recently and they can be grouped into several categories depending on the bicluster model, the search strategy, and the algorithmic framework used. Factorization-based biclustering algorithm uses spectral decomposition technique to uncover natural substructures that are related to the main patterns of the data matrix. There are two main EA frameworks. The first is based on the genetic algorithm (GA), and the second is based on the artificial immune system (AIS).
Journal Title
Conference Title
Book Title
Evolutionary Computation in Gene Regulatory Network Research
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Pattern recognition
Semi- and unsupervised learning