Benchmarking a memetic algorithm for ordering microarray data

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benchmarking a memetic algorithm for ordering microarray data

This work introduces a new algorithm for "gene ordering". Given a matrix of gene expression data values, the task is to find a permutation of the gene names list such that genes with similar expression patterns should be relatively close in the permutation. The algorithm is based on a combined approach that integrates a constructive heuristic with evolutionary and Tabu Search techniques in a si...

متن کامل

A New Memetic Algorithm for Ordering Datasets: Applications in Microarray Analysis

Microarray technologies introduced the ability to monitor gene expression for tens of thousands of genes in different conditions. This relatively new tool has transformed genomic research because of the quantity of data that can be collected. However, the amount of data available from microarray data sets is huge and the development of useful tools for its analysis has become one of the major c...

متن کامل

A Multi-parent Memetic Algorithm for the Linear Ordering Problem

In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a multi-parent recombination operator for generating offspring solutions and a distance-and-quality based criterion for pool updating. Our MPM algorithm is assessed on 8 sets of 484 widely used LOP instances and compared wi...

متن کامل

A memetic algorithm for discovering negative correlation biclusters of DNA microarray data

Most biclustering algorithms for microarrays data analysis focus on positive correlations of genes. However, recent studies demonstrate that groups of biologically significant genes can show negative correlations as well. So, discovering negatively correlated patterns from microarrays data represents a real need. In this paper, we propose a Memetic Biclustering Algorithm (MBA) which is able to ...

متن کامل

Memetic Algorithms for Feature Selection on Microarray Data

In this paper, we present two novel memetic algorithms (MAs) for gene selection. Both are synergies of Genetic Algorithm (wrapper methods) and local search methods (filter methods) under a memetic framework. In particular, the first MA is a Wrapper-Filter Feature Selection Algorithm (WFFSA) fine-tunes the population of genetic algorithm (GA) solutions by adding or deleting features based on uni...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Biosystems

سال: 2007

ISSN: 0303-2647

DOI: 10.1016/j.biosystems.2006.04.005