返回
Genetic operators for combinatorial optimization in TSP and microarray gene ordering
DOI:10.1007/s10489-006-0018-y.png)
摘要
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
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
暂无机构信息
引用论文
Investigation of morphologies and characterization of rare earth metal samarium hexacyanoferrate and its composite with surfactant intercalated graphene oxide for sensor applications
RSC Adv.
IF0
Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization通过微阵列杂交全面鉴定酿酒酵母的细胞周期调控基因
Interpreting patterns of gene expression with self-organizing maps: Methods and application to hematopoietic differentiation用自组织图谱解释基因表达模式: 造血分化的方法和应用
The Effect of Positive Charge Distribution on the Cryoprotective Activity of Dehydrins
Biomolecules
IF0

