Assessment of gene order computing methods for Alzheimer's disease

• Main Authors: Hu Benqiong, Jiang Gang, Pang Chaoyang, Wang Shipeng, Liu Qingzhong, Chen Zhongxue, Vanderburg Charles R, Rogers Jack T, Deng Youping, Huang Xudong
• Format: Article
• Language: English
• Published: BMC 2013-01-01
• Series: BMC Medical Genomics

<p>Abstract</p> <p>Background</p> <p>Computational genomics of Alzheimer disease (AD), the most common form of senile dementia, is a nascent field in AD research. The field includes AD gene clustering by computing gene order which generates higher quality gene clustering patterns than most other clustering methods. However, there are few available gene order computing methods such as Genetic Algorithm (GA) and Ant Colony Optimization (ACO). Further, their performance in gene order computation using AD microarray data is not known. We thus set forth to evaluate the performances of current gene order computing methods with different distance formulas, and to identify additional features associated with gene order computation.</p> <p>Methods</p> <p>Using different distance formulas- Pearson distance and Euclidean distance, the squared Euclidean distance, and other conditions, gene orders were calculated by ACO and GA (including standard GA and improved GA) methods, respectively. The qualities of the gene orders were compared, and new features from the calculated gene orders were identified.</p> <p>Results</p> <p>Compared to the GA methods tested in this study, ACO fits the AD microarray data the best when calculating gene order. In addition, the following features were revealed: different distance formulas generated a different quality of gene order, and the commonly used Pearson distance was not the best distance formula when used with both GA and ACO methods for AD microarray data.</p> <p>Conclusion</p> <p>Compared with Pearson distance and Euclidean distance, the squared Euclidean distance generated the best quality gene order computed by GA and ACO methods.</p>