Cargando…

Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data

BACKGROUND: Multi-objective optimization (MOO) involves optimization problems with multiple objectives. Generally, theose objectives is used to estimate very different aspects of the solutions, and these aspects are often in conflict with each other. MOO first gets a Pareto set, and then looks for b...

Descripción completa

Detalles Bibliográficos
Autores principales: Liu, Junwan, Li, Zhoujun, Hu, Xiaohua, Chen, Yiming, Liu, Feifei
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2012
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3394423/
https://www.ncbi.nlm.nih.gov/pubmed/22759615
http://dx.doi.org/10.1186/1471-2164-13-S3-S6
_version_ 1782237866910285824
author Liu, Junwan
Li, Zhoujun
Hu, Xiaohua
Chen, Yiming
Liu, Feifei
author_facet Liu, Junwan
Li, Zhoujun
Hu, Xiaohua
Chen, Yiming
Liu, Feifei
author_sort Liu, Junwan
collection PubMed
description BACKGROUND: Multi-objective optimization (MOO) involves optimization problems with multiple objectives. Generally, theose objectives is used to estimate very different aspects of the solutions, and these aspects are often in conflict with each other. MOO first gets a Pareto set, and then looks for both commonality and systematic variations across the set. For the large-scale data sets, heuristic search algorithms such as EA combined with MOO techniques are ideal. Newly DNA microarray technology may study the transcriptional response of a complete genome to different experimental conditions and yield a lot of large-scale datasets. Biclustering technique can simultaneously cluster rows and columns of a dataset, and hlep to extract more accurate information from those datasets. Biclustering need optimize several conflicting objectives, and can be solved with MOO methods. As a heuristics-based optimization approach, the particle swarm optimization (PSO) simulate the movements of a bird flock finding food. The shuffled frog-leaping algorithm (SFL) is a population-based cooperative search metaphor combining the benefits of the local search of PSO and the global shuffled of information of the complex evolution technique. SFL is used to solve the optimization problems of the large-scale datasets. RESULTS: This paper integrates dynamic population strategy and shuffled frog-leaping algorithm into biclustering of microarray data, and proposes a novel multi-objective dynamic population shuffled frog-leaping biclustering (MODPSFLB) algorithm to mine maximum bicluesters from microarray data. Experimental results show that the proposed MODPSFLB algorithm can effectively find significant biological structures in terms of related biological processes, components and molecular functions. CONCLUSIONS: The proposed MODPSFLB algorithm has good diversity and fast convergence of Pareto solutions and will become a powerful systematic functional analysis in genome research.
format Online
Article
Text
id pubmed-3394423
institution National Center for Biotechnology Information
language English
publishDate 2012
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-33944232012-07-16 Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data Liu, Junwan Li, Zhoujun Hu, Xiaohua Chen, Yiming Liu, Feifei BMC Genomics Proceedings BACKGROUND: Multi-objective optimization (MOO) involves optimization problems with multiple objectives. Generally, theose objectives is used to estimate very different aspects of the solutions, and these aspects are often in conflict with each other. MOO first gets a Pareto set, and then looks for both commonality and systematic variations across the set. For the large-scale data sets, heuristic search algorithms such as EA combined with MOO techniques are ideal. Newly DNA microarray technology may study the transcriptional response of a complete genome to different experimental conditions and yield a lot of large-scale datasets. Biclustering technique can simultaneously cluster rows and columns of a dataset, and hlep to extract more accurate information from those datasets. Biclustering need optimize several conflicting objectives, and can be solved with MOO methods. As a heuristics-based optimization approach, the particle swarm optimization (PSO) simulate the movements of a bird flock finding food. The shuffled frog-leaping algorithm (SFL) is a population-based cooperative search metaphor combining the benefits of the local search of PSO and the global shuffled of information of the complex evolution technique. SFL is used to solve the optimization problems of the large-scale datasets. RESULTS: This paper integrates dynamic population strategy and shuffled frog-leaping algorithm into biclustering of microarray data, and proposes a novel multi-objective dynamic population shuffled frog-leaping biclustering (MODPSFLB) algorithm to mine maximum bicluesters from microarray data. Experimental results show that the proposed MODPSFLB algorithm can effectively find significant biological structures in terms of related biological processes, components and molecular functions. CONCLUSIONS: The proposed MODPSFLB algorithm has good diversity and fast convergence of Pareto solutions and will become a powerful systematic functional analysis in genome research. BioMed Central 2012-06-11 /pmc/articles/PMC3394423/ /pubmed/22759615 http://dx.doi.org/10.1186/1471-2164-13-S3-S6 Text en Copyright ©2012 Liu et al; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Proceedings
Liu, Junwan
Li, Zhoujun
Hu, Xiaohua
Chen, Yiming
Liu, Feifei
Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data
title Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data
title_full Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data
title_fullStr Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data
title_full_unstemmed Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data
title_short Multi-objective dynamic population shuffled frog-leaping biclustering of microarray data
title_sort multi-objective dynamic population shuffled frog-leaping biclustering of microarray data
topic Proceedings
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3394423/
https://www.ncbi.nlm.nih.gov/pubmed/22759615
http://dx.doi.org/10.1186/1471-2164-13-S3-S6
work_keys_str_mv AT liujunwan multiobjectivedynamicpopulationshuffledfrogleapingbiclusteringofmicroarraydata
AT lizhoujun multiobjectivedynamicpopulationshuffledfrogleapingbiclusteringofmicroarraydata
AT huxiaohua multiobjectivedynamicpopulationshuffledfrogleapingbiclusteringofmicroarraydata
AT chenyiming multiobjectivedynamicpopulationshuffledfrogleapingbiclusteringofmicroarraydata
AT liufeifei multiobjectivedynamicpopulationshuffledfrogleapingbiclusteringofmicroarraydata