Cargando…
Fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data
BACKGROUND: Metaheuristics are widely used to solve large combinatorial optimization problems in bioinformatics because of the huge set of possible solutions. Two representative problems are gene selection for cancer classification and biclustering of gene expression data. In most cases, these metah...
Autores principales: | , , , , , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5007680/ https://www.ncbi.nlm.nih.gov/pubmed/27581798 http://dx.doi.org/10.1186/s12859-016-1200-9 |
_version_ | 1782451251934396416 |
---|---|
author | Gomez-Pulido, Juan A. Cerrada-Barrios, Jose L. Trinidad-Amado, Sebastian Lanza-Gutierrez, Jose M. Fernandez-Diaz, Ramon A. Crawford, Broderick Soto, Ricardo |
author_facet | Gomez-Pulido, Juan A. Cerrada-Barrios, Jose L. Trinidad-Amado, Sebastian Lanza-Gutierrez, Jose M. Fernandez-Diaz, Ramon A. Crawford, Broderick Soto, Ricardo |
author_sort | Gomez-Pulido, Juan A. |
collection | PubMed |
description | BACKGROUND: Metaheuristics are widely used to solve large combinatorial optimization problems in bioinformatics because of the huge set of possible solutions. Two representative problems are gene selection for cancer classification and biclustering of gene expression data. In most cases, these metaheuristics, as well as other non-linear techniques, apply a fitness function to each possible solution with a size-limited population, and that step involves higher latencies than other parts of the algorithms, which is the reason why the execution time of the applications will mainly depend on the execution time of the fitness function. In addition, it is usual to find floating-point arithmetic formulations for the fitness functions. This way, a careful parallelization of these functions using the reconfigurable hardware technology will accelerate the computation, specially if they are applied in parallel to several solutions of the population. RESULTS: A fine-grained parallelization of two floating-point fitness functions of different complexities and features involved in biclustering of gene expression data and gene selection for cancer classification allowed for obtaining higher speedups and power-reduced computation with regard to usual microprocessors. CONCLUSIONS: The results show better performances using reconfigurable hardware technology instead of usual microprocessors, in computing time and power consumption terms, not only because of the parallelization of the arithmetic operations, but also thanks to the concurrent fitness evaluation for several individuals of the population in the metaheuristic. This is a good basis for building accelerated and low-energy solutions for intensive computing scenarios. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1186/s12859-016-1200-9) contains supplementary material, which is available to authorized users. |
format | Online Article Text |
id | pubmed-5007680 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2016 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-50076802016-09-08 Fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data Gomez-Pulido, Juan A. Cerrada-Barrios, Jose L. Trinidad-Amado, Sebastian Lanza-Gutierrez, Jose M. Fernandez-Diaz, Ramon A. Crawford, Broderick Soto, Ricardo BMC Bioinformatics Research Article BACKGROUND: Metaheuristics are widely used to solve large combinatorial optimization problems in bioinformatics because of the huge set of possible solutions. Two representative problems are gene selection for cancer classification and biclustering of gene expression data. In most cases, these metaheuristics, as well as other non-linear techniques, apply a fitness function to each possible solution with a size-limited population, and that step involves higher latencies than other parts of the algorithms, which is the reason why the execution time of the applications will mainly depend on the execution time of the fitness function. In addition, it is usual to find floating-point arithmetic formulations for the fitness functions. This way, a careful parallelization of these functions using the reconfigurable hardware technology will accelerate the computation, specially if they are applied in parallel to several solutions of the population. RESULTS: A fine-grained parallelization of two floating-point fitness functions of different complexities and features involved in biclustering of gene expression data and gene selection for cancer classification allowed for obtaining higher speedups and power-reduced computation with regard to usual microprocessors. CONCLUSIONS: The results show better performances using reconfigurable hardware technology instead of usual microprocessors, in computing time and power consumption terms, not only because of the parallelization of the arithmetic operations, but also thanks to the concurrent fitness evaluation for several individuals of the population in the metaheuristic. This is a good basis for building accelerated and low-energy solutions for intensive computing scenarios. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1186/s12859-016-1200-9) contains supplementary material, which is available to authorized users. BioMed Central 2016-08-31 /pmc/articles/PMC5007680/ /pubmed/27581798 http://dx.doi.org/10.1186/s12859-016-1200-9 Text en © The Author(s) 2016 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. |
spellingShingle | Research Article Gomez-Pulido, Juan A. Cerrada-Barrios, Jose L. Trinidad-Amado, Sebastian Lanza-Gutierrez, Jose M. Fernandez-Diaz, Ramon A. Crawford, Broderick Soto, Ricardo Fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data |
title | Fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data |
title_full | Fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data |
title_fullStr | Fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data |
title_full_unstemmed | Fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data |
title_short | Fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data |
title_sort | fine-grained parallelization of fitness functions in bioinformatics optimization problems: gene selection for cancer classification and biclustering of gene expression data |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5007680/ https://www.ncbi.nlm.nih.gov/pubmed/27581798 http://dx.doi.org/10.1186/s12859-016-1200-9 |
work_keys_str_mv | AT gomezpulidojuana finegrainedparallelizationoffitnessfunctionsinbioinformaticsoptimizationproblemsgeneselectionforcancerclassificationandbiclusteringofgeneexpressiondata AT cerradabarriosjosel finegrainedparallelizationoffitnessfunctionsinbioinformaticsoptimizationproblemsgeneselectionforcancerclassificationandbiclusteringofgeneexpressiondata AT trinidadamadosebastian finegrainedparallelizationoffitnessfunctionsinbioinformaticsoptimizationproblemsgeneselectionforcancerclassificationandbiclusteringofgeneexpressiondata AT lanzagutierrezjosem finegrainedparallelizationoffitnessfunctionsinbioinformaticsoptimizationproblemsgeneselectionforcancerclassificationandbiclusteringofgeneexpressiondata AT fernandezdiazramona finegrainedparallelizationoffitnessfunctionsinbioinformaticsoptimizationproblemsgeneselectionforcancerclassificationandbiclusteringofgeneexpressiondata AT crawfordbroderick finegrainedparallelizationoffitnessfunctionsinbioinformaticsoptimizationproblemsgeneselectionforcancerclassificationandbiclusteringofgeneexpressiondata AT sotoricardo finegrainedparallelizationoffitnessfunctionsinbioinformaticsoptimizationproblemsgeneselectionforcancerclassificationandbiclusteringofgeneexpressiondata |