arrow
返回

Genetic operators for combinatorial optimization in TSP and microarray gene ordering

delete2006-11-09
delete51
PRE
AI
S
Shubhra Sankar Ray *
S
Sanghamitra Bandyopadhyay
S
Sankar K. Pal
DOI:10.1007/s10489-006-0018-ydelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper deals with some new operators of genetic algorithms and[-27pc] demonstrates their effectiveness to the traveling salesman problem (TSP) and microarray gene ordering. The new operators developed are nearest fragment operator based on the concept of nearest neighbor heuristic, and a modified version of order crossover operator. While these result in faster convergence of Genetic Algorithm (GAs) in finding the optimal order of genes in microarray and cities in TSP, the nearest fragment operator can augment the search space quickly and thus obtain much better results compared to other heuristics. Appropriate number of fragments for the nearest fragment operator and appropriate substring length in terms of the number of cities/genes for the modified order crossover operator are determined systematically. Gene order provided by the proposed method is seen to be superior to other related methods based on GAs, neural networks and clustering in terms of biological scores computed using categorization of the genes.
Keyword:
microarray
gene analysis
data mining
biocomputing
evolutionary algorithm
soft computing

期刊

Applied Intelligence 封面图
Applied Intelligence
IF:
3.5
论文数:
7.6K
被引数:
1.7W

机构

暂无机构信息
引用论文

引用论文

An Effective HIV Vaccine: A Combination of Humoral and Cellular Immunity?
err2010-09-01
err0
PREAI
errSihame Benmira; Vish Bhattacharya; Matthias Schmid
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容