2003
DOI: 10.1007/3-540-36605-9_3
|View full text |Cite
|
Sign up to set email alerts
|

Applying Memetic Algorithms to the Analysis of Microarray Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
16
0

Year Published

2005
2005
2017
2017

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 23 publications
(16 citation statements)
references
References 13 publications
0
16
0
Order By: Relevance
“…3. (a) A clustering using the memetic algorithm of [1] of the union of all the genes reported in Fig. 2.…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…3. (a) A clustering using the memetic algorithm of [1] of the union of all the genes reported in Fig. 2.…”
Section: Resultsmentioning
confidence: 99%
“…For 29 of them, we have found that there is a microarray data study in the public domain that contains their gene expression in control and Alzheimer's affected brains. A visual inspection of the relative gene expression of this dataset (containing approximately 2,000 genes), clustered with our memetic algorithm [1], clearly shows a pattern of differentiated gene expression in healthy and Alzheimer's affected brains (see Fig. 1).…”
Section: Introductionmentioning
confidence: 95%
See 1 more Smart Citation
“…Experiments focusing on the effect of the window size indicate that a size of window between s w = 5% and s w = 10% of the instance size is a good tradeoff between solution quality and computational cost [7]. It should be also emphasized that although the use of the 'moving windows' function was a major breakthrough, the correct adjustment of the MA also played an important role.…”
Section: The Fitness Functionmentioning
confidence: 99%
“…We adopted the restriction that recombination can only be made between a leader and one of its supporters within the same cluster. The recombination procedure (the Prune-Delete-Graft operator, check [7]) thus selects any leader uniformly at random and then it chooses -also uniformly at random -one of the three supporters. Indirectly, this recombination is also fitness-biased, since individuals situated at the upper nodes are better than the ones at the lower nodes.…”
Section: Representation and Operatorsmentioning
confidence: 99%