 Research
 Open
 Published:
Assessment of gene order computing methods for Alzheimer's disease
BMC Medical Genomicsvolume 6, Article number: S8 (2013)
Abstract
Background
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.
Methods
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.
Results
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.
Conclusion
Compared with Pearson distance and Euclidean distance, the squared Euclidean distance generated the best quality gene order computed by GA and ACO methods.
Background
A brief introduction of Alzheimer's disease
Being the most common form of agerelated dementia, Alzheimer's disease (AD) affects 5.4 million Americans, and at least $183 billion will be spent in 2011 on care of AD and other dementia patients. The problem is worsening as life expectancy continues to increase. By 2050, the projected number of AD patients could range from 11 to 16 million people in the United States alone if no cure or preventive measure for AD is found. Hence, AD has quickly become a pandemic and exacted a huge socioeconomic toll [1].
AD is named after Dr Alois Alzheimer, who has first investigated the disease [2]. Later on, the autopsies of brain examinations of most cases of senility under light microscope were discovered to be extracellular deposits of βamyloid and intracellular deposits of neurofibrillary tangles (NFTs). Abundant amounts of these lesions in the brain were necessary for a confirmed diagnosis of AD [3]. In 1984, an possible ADrelated gene on chromosome 21 was implied when Glenner and Wong reported on the amino acid sequence of the main component of βamyloid, an approximate 4.3 kD peptide that they coined as "amyloidβ protein"(Aβ) based on their analysis of cerebrovascular amyloid derived from patients with Down's syndrome [4]. This study has laid the foundation for AD's "amyloid hypothesis" which claims that the accumulation of Aβ, as determined by its generation versus clearance in the brain, is the primary driver of ADrelated pathogenesis, including neuronal cell death.
Frangione et al reported on the sequencing of the exons 16 and 17 of amyloid precursor protein (APP) to reveal the first pathogenic mutation in APP [5]. Finally the subsequent sequencing of these same two APP exons (encoding the Aβ portion of the molecule) that were truly linked to chromosome 21 led to the discovery of the first ADrelated mutation [6]. Following this finding, PericakVance and colleagues reported a significant genetic linkage of the more common lateonset of AD (> 65 years) to chromosome 19 [7]. Then in 1993, they found a common polymorphism in the gene encoding Apolipoprotein E (APOE) APOE allele 4, is associated with increased risk for AD [8]. In 1993, the first study aimed at investigating the Presenilins as putative AD genes offered evidence for a significant association between a singlenucleotide polymorphism (SNP) in intron 8 of the Presenilin 1 (PSEN1) gene and AD. Estimates were that the common variants in PSEN1 could account for nearly half of the populationattributable risk for AD than was found for the APOE4 allele [9]. Then in 2001, a report investigating a consecutive series of referralbased AD cases found coding sequence mutations in 11% of the samples, suggesting that PSEN1 mutations may indeed be more frequent in the general population than had been previously assumed [10, 11]. Furthermore, reports indicated that changes in the promoter region could lead to an altered expression pattern of the protein in neurons [12].
Currently, the mainly proposed therapeutic intervention for AD is antiamyloid approach, which ranges from interdicting amyloidogenic processing of the βamyloid precursor protein (APP) to removing amyloid plaques in the brain [13]. In addition to therapies based on curbing the production of Aβ or enhancing its clearance, another therapeutic strategy would be aimed at attenuating Aβ toxicity and neuroinflammation in the AD brain. Perhaps, the most effective way to approach the blocking of Aβ toxicity would be to prevent the formation of neurotoxic Aβ oligomers [3, 14]. As APP, the Presenilins, and APOE represent the only firmly established AD genes to date for AD, they represent the most effective means of curbing the production of Aβ or accelerating the clearance and degradation of this peptide in the brain [3]. The identification of the remaining genes involved in AD will enable investigators and clinicians to further delineate the path of biological events that lead to ADrelated neurodegeneration [3].
Introduction of gene clustering and gene order
Having been applied to many biological domains, such as drug discovery, molecular diagnosis, and toxicological research, DNA microarray technology is used most importantly to generate gene data, which holds a lot of biological information. One common data structure of a microarray data set is the presentation of a matrix. In matrix X, element X_{ ij } represents the expression level of the ith gene in the jth experiment. Then the ith line vector of matrix X represents a group of expression levels of the ith gene. The ith line vector contains the biological information of the ith gene, and it is often used as an atom object of data to be processed.
One important aspect of biology is to make similar genes cluster together. Since line vectors of a matrix contain the information of genes, clustering similar vectors together is equivalent to cluster similar genes together. A number of algorithms were proposed to cluster gene expression profiles. Eisen et al. [15] applied hierarchical clustering [16], a widely used tool [17–20], to solve the problem. It also has some variants [21, 22]. Selforganizing maps (SOMs) [23, 24] and kmeans clustering [25] were also used for the same purpose. BenDor et al. [26] developed an algorithm cluster affinity search technique (CAST), that has a good theoretical basis. Merz and Zell [27] proposed a memetic algorithm for the problem, formulated as finding the minimum sumofsquares clustering [28, 29].
To achieve a much better quality of clustering, the computing concept of gene order has been proposed. Gene order is the permutation of all line vectors in such a way that all the line vectors are ordered one by one in a sequence, and that similar vectors are ordered together. A gene is associated with a line vector of a matrix. The optimal gene order refers to the permutation that results in a sequence that all the vectors line up via the minimal distance. Alternatively, computing optimal gene order is equivalent to identifying a route of the traveling salesman problem (TSP) in which every vector associates with a gene that has been abstracted as a virtual city [30–35].
Since TSP is an NPhard problem, the computation of the optimal gene order is NPhard and only the approximation of the optimal gene order can be calculated. To obtain the approximation of the optimal gene order, Tsai et al. applied a family competition genetic algorithm (FCGA) [33–36] and SeungKyu et al. applied a hybrid genetic algorithm (NNGA) [37].
Introduction of ant colony optimization (ACO)
First introduced in 1992, ant colony optimization (ACO) is a novel natureinspired method based on the foraging behavior of real ants to solve TSP. (Dorigo, 1992; Dorigo et al., 1996, 1999; Dorigo and Stützle, 2004) [38]. When searching for food, ants initially explore the area surrounding their nest in a random manner. As soon as an ant finds a food source, it evaluates it and carries some food back to the nest. During the return trip, the ant deposits a pheromone trail on the ground. The pheromone deposited, the amount of which may depend on the quantity and quality of the food, guides other ants to the food source. As it has been shown (Goss et al., 1989), indirect communication among ants via pheromone trails enables them to find the shortest paths between their nests and food sources. ACO generates the TSP route of the highest quality in general compared with other methods. However, it is a challenge to apply ACO to calculating gene order; its running time has been too long even for input data that has less than 1000 elements when a common personal computer is used. To make ACO better suited for the computation of gene order, we have improved its running speed by factors of at least 200 [39, 40].
Introduction of genetic algorithm
Genetic algorithm (GA) can be understood as an intelligent probabilistic search algorithm that works on Darwin's principle of natural selection and that can be applied to a variety of combinatorial optimization problems [41]. More to the point, GAs are based on the evolutionary process of biological organisms in nature about which theoretical foundations were originally developed by Holland [32]. During the course of evolution, natural populations evolve according to the principle of natural selection and "survival of the fittest". Individuals who are more successful in adapting to their environments will have a better chance of surviving and reproducing, whilst individuals who are less fit will be eliminated.
To understand the outline of GA as in [42], the following original statement is given:
A GA simulates these processes by taking an initial population of individuals and applying a genetic algorithm to their reproduction. In optimization terms, each individual in the population is encoded into a string or chromosome that represents a possible solution to a given problem. The fitness of an individual is evaluated with respect to a given objective function. Highly fit individuals or solutions have opportunities to reproduce by exchanging pieces of their genetic information, in a crossover procedure, with other highly fit individuals. This produces new "offspring" solutions (i.e., children), who share some characteristics taken from both parents [43].
To date, there are few types of tools to calculate gene order. In our knowledge, GA [35] and ACO [39] are mostly used methods. Our study intends to address this question which method is a better for AD gene order computation using AD microarray data under different conditions. Herein, we reported that ACO fits the AD microarray data the best when calculating gene order in comparison to the GA methods tested in this study.
Methods
This study intends to answer the question of which algorithm, between ACO and GA, generates the optimal AD gene order. The distance formula, which measures the similarity degree of two genes, is the key parameter that affects the quality of gene order. With different distance formulas (see the following Formulae 13), the gene orders will be calculated using the tools of ACO and GA in this section. Then, the quality of gene order will be measured both by the fitness function and by a heat map.
Traveling salesman problem (TSP)
TSP is introduced below:
Assume that there are n cities and a distance matrix D = [d_{ ij }], where d_{ ij } is the distance between city i and city j, and TSP is the problem of finding a permutation π of all the cities such that minimizes ${\sum}_{i=1}^{n1}{d}_{\pi \left(i\right),\pi \left(i+1\right)}+{d}_{\pi \left(n\right),\pi \left(1\right)}$.
Measurement of gene similarity
As aforementioned, a gene associates with a vector and the similarity of two genes can be estimated by the distance between the two vectors.
For two genes, different metric measurements will measure out different degrees of possible similarity. That is, the estimation of gene similarity is sensitive to the distance formula.
Many distance formulas of vectors to measure the similarity of genes are presented, such as Pearson correlation, absolute correlation, Spearman rank correlation [44], Kendall rank correlation [45], and Euclidean distance. In this paper, three popular distance formulas are introduced below.
The first distance measure is the Pearson correlation:
Let kdimensional vector X = (x_{1}, x_{2}, ..., x_{ k }) and Y = (y_{1}, y_{2}, ..., y_{ k }) be the expression levels of two genes X and Y, which are observed over a series of k conditions. The Pearson correlation of two genes X and Y is
, where $\overline{X}$ and σ_{ X } is the mean and the standard deviation of the expression levels, respectively. The value of σ_{ X } is
Pearson distance is defined as
The second distance is the Euclidean distance:
The third distance measure is the squared Euclidean distance:
Gene order
As it is introduced before, a gene is associated with a vector that is derived from microarray data. In this way, a gene can be regarded as a virtual city whereby each coordinate is a vector. Two associated genes are more similar as the distance shortens between two virtual cities. As it is introduced at Section 1, an optimal (shortest) TSP route for a given set of virtual cities is the optimal gene order that is a permutation of all genes. In an optimal TSP route, closed cities are ordered together and the length of the route is that which is the shortest. In an optimal gene order, similar genes cluster together, and the quality of clustering is optimal globally. This is in contrast to many clustering methods that are only optimal locally.
Currently optimal gene order cannot be calculated perfectly because it is an NPhard problem; only an approximation can be achieved. Therefore, we need a function to measure the quality of the approximation. The following function Q(π) is called a fitness function:
where g_{ i } denotes a vector associated with a gene, π denotes a gene order, n is the number of genes, D(g_{ i }, g_{i+1}) is the distance between gene g_{ i } and gene g_{i+1}, and ${g}_{{\pi}_{n+1}}={g}_{{\pi}_{1}}$. The distance formula D(g_{ i }, g_{i+1}) can be chosen from Pearson distance, Euclidean distance, squared Euclidean distance, Spearman distance, and other measurements.
Function Q(π) is a measurement of the quality of the gene order. The smaller the function value Q(π) is, the better the quality of the gene order π is.
However, the measurement of function Q(π) is not consistent with the fact of biology, and a true review of the quality of gene order depends on the review of a biologist. A biologist often reviews the quality of gene clustering by visually observing its heat map, and he or she often gets heuristic information from that heat map.
Apply ACO to calculate optimal gene order
To generate the optimal gene order, ACO is applied as it is below:
Step 1: Use the distance formula to compute the distance between genes.
Step 2: Initialize the pheromone trails for all edges between genes (or virtual cities) and put m ants at different genes to travel. Preassign an iteration number t_{max} and let t = 0, where t denotes the t  th iteration computation.
Step 3: while(t <t_{max})
{
Step 3.1: Each ant selects its next city according to the transition probability ${p}_{ij}^{k}\left(t\right)$.
The transition probability of the k  th ant from the i  th gene to j  th gene is defined as
, where allowed_{ k } denotes the set of genes that can be accessed by the k  th ant; τ_{ ij }(t) is the pheromone value of the edge (i, j); η_{ ij }(t) is the local heuristic function and η_{ ij }(t) = 1/d_{ ij }, and where d_{ ij } are the distance between the i  th gene and j  th gene; the parameters α and β determine the relative influence of the trail strength and the heuristic information, respectively.
Step 3.2: After all ants finish their travels, all pheromone values τ_{ ij }(t) are updated according to the following formula.
, where L_{ k } is the length of the route passed by the k  th ant; ρ is the persistence of the trail; Q denotes constant quantity of pheromone; and e(i, j) represents the edge between gene i and gene j.
Step 3.3: t = t + 1
}
Step 4: End procedure and select the TSP route that has the minimum length as the output.
Apply GAs to calculate optimal gene order
As mentioned before, the calculation of gene order can be converted to TSP. To make GA fit to process TSP and gene order, the commonly used GA is modified a little. The modifications are listed below:
First, the roulette rule [46] is used to design selection probability.
Second, the crossover probability is set to be 1.0 in this paper. That is, the crossover will occur definitely.
Third, the mutation is designed to occur. Between the parent and mutated offspring, the one which has the better fitness value is selected as the genuine offspring, and the others are discarded.
The modified GA is described below:
Step 1: Initialization: Set the maximum iteration number to t_{max}. The tth iteration step is denoted by t. In this paper, the length of the chromosome is set to be the number of AD genes, which is denoted by L. The initial population is denoted by P_{ old }, and its size is set to be N.
Step 2: The next generation is denoted by P_{ new }, and it is initialized to be an empty set. In addition, a counter is used, which is denoted by c, and it is initialized to be 1.
Step 3: Selection

1.
Calculate each chromosome's fitness value according to formula (4).

2.
Calculate the proportion (ratio) of the fitness value of each chromosome.

3.
A ratio is chosen by the roulette rule, and its associated chromosome is chosen too. According to this method, two chromosomes are chosen, which are denoted by C_{1} and C_{2}.
Step 4: Crossover

1.
Generate two random integer numbers between 1 and L, which are denoted by C_{point1 }and C_{point2}(C_{point1 }<C_{point2}), and where C_{point1 }and C_{point2 }are used to indicate the positions of two crossovers on chromosomes C_{1} and C_{2}.

2.
Denote the part of C_{2} from C_{point1 }to C_{point2 }as C_{t2}, and copy it to the head of C_{1}. The increased chromosome C_{1} is denoted by ${C}_{1}^{\prime}$.
Denote the part of C_{1} from C_{point1 }to C_{point2 }as C_{t1}, and copy it to the head of C_{2}. The increased chromosome C_{2} is denoted by ${C}_{2}^{\prime}$.

3.
Find every gene that lies in chromosome C_{t2 }and C_{1}, which is denoted by x (i.e., x ∊ C_{t2 }∩ C_{1}). Delete every x from C_{1}, and add C_{t2 }to the head of updated C_{1} (i.e., ${C}_{1}^{\prime}\leftarrow {C}_{t2}\cup \left({C}_{1}\left\{x\right\}\right)$). The updated ${C}_{1}^{\prime}$ is regarded as temporary offspring of C_{1} and denoted as T_{offspring1}. Using the same method, the temporary offspring of C_{2} is generated, which is denoted as T_{offspring2}.
Step 5: Mutation
Select a point on T_{offspring1 }randomly as a mutation point, which is denoted by M_{point1}. Suppose the value of mutation point M_{point1 }is V_{ old }. Generate a random integer between 1 and L , which is denoted by V_{ new }. Set V_{ new } as the updated value of point M_{point1}.
Find the point at which value is equal to V_{ new } except point M_{point1}, and update its value as V_{ old }.
The chromosome T_{offspring1 }is updated, and it is a true offspring.
Using the above method, chromosome T_{offspring2 }can also be updated, and it is a true offspring.
Step 6: Add the two true offspring into the set P_{ new }, which represents the new population. Update the counter:
c = c + 2, if c <N, go to Step 3, or else go to Step 7.
Step 7: Joint population P_{ old } and P_{ new } (i.e., P = P_{ old } ∪ P_{ new }). Select N chromosomes from set P to cover the old population P_{ old } for which the fitness values are smaller than the other chromosomes.
Step 8: Increase the iteration step: t = t + 1. If t <t_{max}, and go to step 2, or else go to Step 9.
Step 9: End the algorithm and choose the chromosome that has the smallest fitness value from the last population P_{ old } as the output.
Kirk presented an improved GA (IGA) program [47], and it consists of three parts: mutation, group, and iteration.
Part I (operation of mutation)
Suppose there is a chromosome{a_{1}, a_{2}, a_{3}, a_{4}, a_{5}, a_{6}}, and it is a permutation of genes a_{1}, a_{2}, a_{3}, a_{4}, a_{5} and a_{6}. Firstly, cut a subsequence from the chromosome randomly, and suppose it is {a_{2}, a_{3}, a_{4}, a_{5}}. Three types of mutations are listed below:
Flip operation M_{ f }:
Flip the gene positions of the subsequence. For example, $\left\{{a}_{2},{a}_{3},{a}_{4},{a}_{5}\right\}\stackrel{{M}_{f}}{\to}\left\{{a}_{5},{a}_{4},{a}_{3},{a}_{2}\right\}$.
Swap operation M_{ s }:
Swap the positions of the two terminal genes$\left\{{a}_{2},{a}_{3},{a}_{4},{a}_{5}\right\}\stackrel{{M}_{s}}{\to}\left\{{a}_{5},{a}_{3},{a}_{4},{a}_{2}\right\}$.
Slide operation M_{ l }:
Shift the gene to the next position by a rotation$\left\{{a}_{2},{a}_{3},{a}_{4},{a}_{5}\right\}\stackrel{{M}_{l}}{\to}\left\{{a}_{3},{a}_{4},{a}_{5},{a}_{2}\right\}$.
Part II (group)
Suppose N chromosomes, denoted by s_{1}, s_{2}, s_{3}, ..., and s_{ N }, are generated randomly where N is divisible by 4. And all chromosomes are saved in a table T sequentially. In table T, every 4 chromosomes is grouped as a team sequentially. For every team, perform the following operations:
Firstly, select the chromosome with the minimal fitness value as seed, and discard the other three chromosomes.
Secondly, let the mutation operation M_{ f }, M_{ s } and M_{ l } act on the seed, respectively, and generate three mutated chromosomes.
Thirdly, all chromosomes in this team are updated as the seed and the three mutated chromosomes, which updates table T.
Part III (iteration computation)
An operation of a group is called an iteration computation. Within every iteration, an optimal chromosome will be generated for which the fitness value is minimal compared to the other N  1 chromosomes. Suppose R_{ t } is the optimal chromosome of the tth iteration. After all, iterations are performed on the set $\left\{{R}_{1},{R}_{2},...,{R}_{{t}_{max}}\right\}$ for a given number of iteration t_{max}. The solution is selected from $\left\{{R}_{1},{R}_{2},...,{R}_{{t}_{max}}\right\}$, which has a minimal fitness value.
Source data
In this paper, the AD microarray data was downloaded from GEO Datasets, NCBI [48], which includes 22283 genes. Four cases of control, incipient, moderate, and severe data are provided in the original data. Nine samples of control are organized to form a matrix with a size of 22283 lines by 9 columns. The format of this matrix is shown in Table 1. In this matrix, each line vector is a 9dimensional vector that represents microarray data of a gene collected from nine different conditions. All line vectors form a data set.
Seven samples of incipient for each gene are selected to form a 7dimensional vector, and the resulting 22283 vectors are used to form a data set; eight samples of moderate for each gene are selected to form an 8dimensional vector and to form a data set; and seven samples of severe for each gene are selected to form a data set.
In addition, according to the usual practice, all data of the AD gene is logtransformed for smoothing.
Computing parameters and environment
All data tested by GAs and ACO run on a personal computer, CPU (2): 2.99 GHZ, 3.0 GHZ; Memory: 1.0 GB.
The parameters of ACO are set below:
α = 1, β = 2, ρ = 0.7, Q = 100, τ_{ ij }(0) = 1, m = 50, t_{max} = 100.
The parameters of GA are set below:
t_{max} = 500, M = 400,
, where t_{max} and M represents the maximal number of iterations and the size of populations, respectively.
The parameters for the improved genetic algorithm are set as below:
t_{max} = 2000, M = 900.
In addition, in GA, parameter values of t_{max} and M are smaller than parameters in IGA, respectively. The reason that the parameter value is different is that GA is much slower than IGA, and a high value of parameter will require excessive GA program running time.
Results and discussion
The results are showed in Figure 1 to Figure 3, and Table 2 to Table 3. From these figures and tables, we discovered that:

(1)
ACO was better suited than GA to calculate the gene order of the AD genes tested in this paper.

(2)
Both for ACO and GAs, the use of different distance formulas generated a different quality of gene order. The squared Euclidean distance generated the best quality overall compared with the Pearson distance and Euclidean distance.
Pearson distance is a popular distance formula that is commonly used to calculate gene order. However, we found that Pearson distance is not the optimal distance formula for the calculation of gene order associated with AD genes. In this paper, the original data is not normalized, the reason for which is explained below:
Suppose two genes and their associated vectors are X = (x_{1}, x_{2}, ..., x_{ k }) and Y = (y_{1}, y_{2}, ..., y_{ k }). If all components of the vector are normalized, they become small real value that is less than 1.0. Value $S={\sum}_{i=1}^{k}{\left({x}_{i}{y}_{i}\right)}^{2}$ is small, and it is close to zero if the two genes are very similar. Then the value of the squareroot $\sqrt{S}$ has a big error because it must be expressed as base operations (+, , ×, and ÷) to approximate. That is why Pearson distance, Euclidean distance and other distance formulas generate lower qualities of gene order calculation compared with squared Euclidean distance.
Conclusion
With AD being the most common form of senile dementia, the study of ADassociated genes is an imperative research subject. One important branch of an AD gene study is to cluster AD genes with the highest quality; gene order generates a better quality of clustering than other methods in general. In addition, our results of the experiment support the following conclusion: ACO is better than GA in AD gene order computation. Further, the following computational features were revealed in our study: For both ACO and GA, different distance formulas generated a different quality of gene order. Compared to Pearson distance and Euclidean distance, the squared Euclidean distance generated the best quality of AD gene order. Although Pearson distance commonly used tool, it is less optimal in AD gene order computation when employed in both ACO and GA methods.
References
 1.
Thies W, Bleiler L: 2011 Alzheimer's disease facts and figures. Alzheimers Dement. 2011, 7: 208244.
 2.
Alzheimer A: "Über eine eigenartige Erkrankung der Hirnrinde"  Die Alzheimersche Krankheit im Brennpunkt von Klinik und Forschung. Allg Zeitschr Psychiatr PsychiatrGerichtl Med. 1907, 109: 146148.
 3.
Tanzi RE, Bertram L: Twenty years of the Alzheimer's disease amyloid hypothesis: a genetic perspective. Cell. 2005, 120: 545555. 10.1016/j.cell.2005.02.008.
 4.
Glenner GG, Wong CW: Alzheimer's disease and Down's syndrome: sharing of a unique cerebrovascular amyloid fibril protein. Biochem Biophys Res Commun. 1984, 122: 11311135. 10.1016/0006291X(84)912099.
 5.
Levy E, Carman MD, FernandezMadrid IJ, Power MD, Lieberburg I, van Duinen SG, Bots GT, Luyendijk W, Frangione B: Mutation of the Alzheimer's disease amyloid gene in hereditary cerebral hemorrhage, Dutch type. Science. 1990, 248: 11241126. 10.1126/science.2111584.
 6.
Goate A, ChartierHarlin MC, Mullan M, Brown J, Crawford F, Fidani L, Giuffra L, Haynes A, Irving N, James L, et al: Segregation of a missense mutation in the amyloid precursor protein gene with familial Alzheimer's disease. Nature. 1991, 349: 704706. 10.1038/349704a0.
 7.
PericakVance MA, Bebout JL, Gaskell PC, Yamaoka LH, Hung WY, Alberts MJ, Walker AP, Bartlett RJ, Haynes CA, Welsh KA, et al: Linkage studies in familial Alzheimer's disease: evidence for chromosome 19 linkage. Am J Hum Genet. 1991, 48: 10341050.
 8.
Schmechel DE, Saunders AM, Strittmatter WJ, Crain BJ, Hulette CM, Joo SH, PericakVance MA, Goldgaber D, Roses AD: Increased amyloid betapeptide deposition in cerebral cortex as a consequence of apolipoprotein E genotype in lateonset Alzheimer's disease. Proc Natl Acad Sci USA. 1993, 90: 96499653. 10.1073/pnas.90.20.9649.
 9.
Wragg M, Hutton M, Talbot C: Genetic association between intronic polymorphism in presenilin1 gene and lateonset Alzheimer's disease. Alzheimer's Disease Collaborative Group. Lancet. 1996, 347: 509512. 10.1016/S01406736(96)91140X.
 10.
Rogaeva EA, Fafel KC, Song YQ, Medeiros H, Sato C, Liang Y, Richard E, Rogaev EI, Frommelt P, Sadovnick AD, et al: Screening for PS1 mutations in a referralbased series of AD cases: 21 novel mutations. Neurology. 2001, 57: 621625. 10.1212/WNL.57.4.621.
 11.
Zhang C, Wu B, Beglopoulos V, WinesSamuelson M, Zhang D, Dragatsis I, Sudhof TC, Shen J: Presenilins are essential for regulating neurotransmitter release. Nature. 2009, 460: 632636. 10.1038/nature08177.
 12.
Lambert JC, Mann DM, Harris JM, ChartierHarlin MC, Cumming A, Coates J, Lemmon H, StClair D, Iwatsubo T, Lendon C: The 48 C/T polymorphism in the presenilin 1 promoter is associated with an increased risk of developing Alzheimer's disease and an increased Abeta load in brain. J Med Genet. 2001, 38: 353355. 10.1136/jmg.38.6.353.
 13.
JakobRoetne R, Jacobsen H: Alzheimer's disease: from pathology to therapeutic approaches. Angew Chem Int Ed Engl. 2009, 48: 30303059. 10.1002/anie.200802808.
 14.
Caughey B, Lansbury PT: Protofibrils, pores, fibrils, and neurodegeneration: separating the responsible protein aggregates from the innocent bystanders. Annu Rev Neurosci. 2003, 26: 267298. 10.1146/annurev.neuro.26.010302.081142.
 15.
Eisen MB, Spellman PT, Brown PO, Botstein D: Cluster analysis and display of genomewide expression patterns. Proc Natl Acad Sci USA. 1998, 95: 1486314868. 10.1073/pnas.95.25.14863.
 16.
Sokal RR, Michener CD: A statistical method for evaluating systematic relationships. University of Kansas Science Bulletin. 1958, 14091438.
 17.
Alizadeh AA, Eisen MB, Davis RE, Ma C, Lossos IS, Rosenwald A, Boldrick JC, Sabet H, Tran T, Yu X, et al: Distinct types of diffuse large Bcell lymphoma identified by gene expression profiling. Nature. 2000, 403: 503511. 10.1038/35000501.
 18.
Kawasaki S, Borchert C, Deyholos M, Wang H, Brazille S, Kawai K, Galbraith D, Bohnert HJ: Gene expression profiles during the initial phase of salt stress in rice. Plant Cell. 2001, 13: 889905.
 19.
Khodursky AB, Peter BJ, Cozzarelli NR, Botstein D, Brown PO, Yanofsky C: DNA microarray analysis of gene expression in response to physiological and genetic changes that affect tryptophan metabolism in Escherichia coli. Proc Natl Acad Sci USA. 2000, 97: 1217012175. 10.1073/pnas.220414297.
 20.
Schaffer R, Landgraf J, Accerbi M, Simon V, Larson M, Wisman E: Microarray analysis of diurnal and circadianregulated genes in Arabidopsis. Plant Cell. 2001, 13: 113123.
 21.
BarJoseph Z, Gifford DK, Jaakkola TS: Fast optimal leaf ordering for hierarchical clustering. Bioinformatics. 2001, 17 (Suppl 1): S2229. 10.1093/bioinformatics/17.suppl_1.S22.
 22.
Herrero J, Valencia A, Dopazo J: A hierarchical unsupervised growing neural network for clustering gene expression patterns. Bioinformatics. 2001, 17: 126136. 10.1093/bioinformatics/17.2.126.
 23.
Tamayo P, Slonim D, Mesirov J, Zhu Q, Kitareewan S, Dmitrovsky E, Lander ES, Golub TR: Interpreting patterns of gene expression with selforganizing maps: methods and application to hematopoietic differentiation. Proc Natl Acad Sci USA. 1999, 96: 29072912. 10.1073/pnas.96.6.2907.
 24.
Toronen P, Kolehmainen M, Wong G, Castren E: Analysis of gene expression data using selforganizing maps. FEBS Lett. 1999, 451: 142146. 10.1016/S00145793(99)005244.
 25.
Tavazoie S, Hughes JD, Campbell MJ, Cho RJ, Church GM: Systematic determination of genetic network architecture. Nat Genet. 1999, 22: 281285. 10.1038/10343.
 26.
BenDor A, Shamir R, Yakhini Z: Clustering gene expression patterns. J Comput Biol. 1999, 6: 281297. 10.1089/106652799318274.
 27.
Merz P, Zell A: Clustering gene expression profiles with memetic algorithms. 7th International Conference on Parallel Problem Solving from Nature. 2002, 811820.
 28.
Edwards AW, CavalliSforza LL: A method for cluster analysis. Biometrics. 1965, 21: 362375. 10.2307/2528096.
 29.
Ward JH: Hierarchical grouping to optimize an objective function. Journal of the American statistical association. 1963, 58: 236244. 10.1080/01621459.1963.10500845.
 30.
BarJoseph Z, Biedl T, Brejova B, Demaine ED, Gifford DK, Hamel AM, Jaakkola TS, Srebro N, Vinar T: Optimal arrangement of leaves in the tree representing hierarchical clustering of gene expression data. Technical Report CS200114. 2001, Dept. of Computer Science, University of Walterloo
 31.
Goldberg DE: Genetic algorithms in search, optimization & machine learning. 1989, Reading, MA: AddisonWesley
 32.
Holland JH: Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. 1975, University of Michigan Press
 33.
Nagata Y, Kobayashi S: Edge assembly crossover: a highpower genetic algorithm fort the traveling salesman problem. 7th International Conference on Genetic Algorithms. 1977, 450457.
 34.
Tsai HK, Yang JM, Kao CY: A genetic algorithm for traveling salesman problems. Genetic and Evolutionary Computation Conference (GECCO 2001). 2001, 687693.
 35.
Tsai HK, Yang JM, Kao CY: Applying genetic algorithms to finding the optimal order in displaying the microarray data. Genetic and Evolutionary Computation Conference (GECCO 2002). 2002, 610617.
 36.
Tsai HK, Yang JM, Kao CY: Solving traveling salesman problems by combining global and local search mechanisms. Congress on Evolutionary Computation (CEC 2002). 2002, 12901295.
 37.
Lee SK, Kim YH, Moon BR: Finding the optimal gene order in displaying microarray data. Lecture Notes in Computer Science. 2003, Springer Berlin/Heidelberg, 16113349.
 38.
Dorigo M, Maniezzo V, Colorni A: Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern B Cybern. 1996, 26: 2941. 10.1109/3477.484436.
 39.
Pang C, Jiang G, Wang S, Hu B, Liu Q, Deng Y, Huang X: Gene order computation using Alzheimer's DNA microarray gene expression data and the ant colony optimization algorithm. International Journal of Data Mining and Bioinformatics.
 40.
Pang C, Wang C, Hu B: Experiment study of entropy convergence of ant colony optimization. arXiv:09051751v4 [csNE]. 2009
 41.
Reeves CR, Beasley JE: Modern heuristic techniques for combinatorial problems. Blackwell Scientific. 1993
 42.
Djannaty F, Doostdar S: A hybrid genetic algorithm for the multidimensional knapsack problem. International Journal of Contemporary Mathematical Sciences. 2008, 3: 443456.
 43.
Glover F, Kochenberger G: Handbook of metaheuristics. Kluwer Academic Publisher. 2003
 44.
Spearman C: The proof and measurement of association between two things. American Journal of Psychology. 1904, 15: 72101. 10.2307/1412159.
 45.
Kendall M: A new measure of rank correlation. Biomerika. 1938, 30: 8193.
 46.
Ueyama T, Fukuda T, Arai F: Configuration using genetic algorithm for cellular robotic system. IROS. 1992, Raleigh, NC, 15421549.
 47.
Kirk J: Traveling salesman problemgenetic algorithm. <http://www.mathworks.com/matlabcentral/fx_files/13680/13682/tsp_ga.zip>
 48.
Blalock EM, Geddes JW, Chen KC, Porter NM, Markesbery WR, Landfield PW: Incipient Alzheimer's disease: microarray correlation analyses reveal major transcriptional and tumor suppressor responses. Proc Natl Acad Sci USA. 2004, 101: 21732178. 10.1073/pnas.0308512100.
Acknowledgements
The work was supported by the BWH Radiology and MGH Psychiatry research funds (to X. Huang) and the Technology Innovation fund (No. 09zz028) of Key Developing Program from Education Department of Sichuan Province, China. The authors appreciate the help from the other members of gene computation group: W. Hu, C.B. Wang, X. Li, H. Liu, L.J. Ye, J.L. Zhou, P. Shuai, and S.Q. Liu. The authors appreciate the help from Prof. J. Zhang and Prof. J. Zhou. The authors would also like to thank Ms. Kimberly Larson of BWH Radiology and Mr. Conan Huang of Brown University and MGH Psychiatry for editing the manuscript.
This article has been published as part of BMC Medical Genomics Volume 6 Supplement 1, 2013: Proceedings of the 2011 International Conference on Bioinformatics and Computational Biology (BIOCOMP'11). The full contents of the supplement are available online at http://www.biomedcentral.com/bmcmedgenomics/supplements/6/S1. Publication of this supplement has been supported by the International Society of Intelligent Biological Medicine.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
BH formulated the computing framework in this paper with CP together. GJ performed computing and drafted this manuscript with CP together. SW wrote part of background section for this manuscript. QL, ZC, CRV, JTR, and YD assisted the study and provided some suggestions. XH initiated the project, provided the guidance for the study, and performed the final editing for the manuscript. All authors have read and approved the final manuscript.
Rights and permissions
About this article
Published
DOI
Keywords
 Genetic Algorithm
 Gene Order
 Amyloid Precursor Protein
 Travel Salesman Problem
 Travel Salesman Problem