Quality of Gene Order Calculated by Ant Colony Algorithm is Sensitive to Distance Formula
Guilin（2009）
摘要
A group of expression levels of gene generated by gene chips is represented by a vector. The smaller the distance of two vectors is, the more similar the two associated genes are. Gene order is the permutation of genes in which similar genes cluster together, which is useful for biologist. And the optimal gene order is equivalent to the shortest route of traveling salesman problem (TSP), in which the associated vectors are used as virtual cities. Ant colony optimization (ACO) is a popular method to solve TSP. In this paper, ACO is applied to calculate gene order. The experiment of this paper shows that the quality of gene order calculated by ACO is sensitive to distance formula of vectors. The contrary fact is shown by this paper that squared Euclidean distance formula generates better quality of gene order than Pearson distance formula, which is used commonly to calculated gene order.
更多查看译文
关键词
gene order quality,optimisation,pattern clustering,traveling salesman problem,pearson distance formula,virtual reality,virtual city,distance formula,gene order,euclidean distance formula,travelling salesman problems,tsp,ant colony optimization,ant colony algorithm,gene chips,similar genes cluster,biology computing,associated vector,optimal gene order,gene clustering,associated gene,calculated gene order,ant colony optimization (aco),better quality,squared euclidean distance formula,gene chip,gene expression levels,correlation,chip,gene expression,gene cluster,euclidean distance
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要