Last data update: 2014.03.03

 R: Weighted Rank Aggregation of partial ordered lists
RankAggregR Documentation

Weighted Rank Aggregation of partial ordered lists

Description

Performs aggregation of ordered lists based on the ranks (optionally with additional weights) via the Cross-Entropy Monte Carlo algorithm or the Genetic Algorithm.

Usage

RankAggreg(x, k, weights=NULL, method=c("CE", "GA"),
distance=c("Spearman", "Kendall"), seed=NULL, maxIter = 1000,
convIn=ifelse(method=="CE", 7, 30), importance=rep(1,nrow(x)),
rho=.1, weight=.25, N=10*k^2, v1=NULL,
popSize=100, CP=.4, MP=.01, verbose=TRUE, ...)

Arguments

x

a matrix of ordered lists to be combined (lists must be in rows)

k

size of the top-k list

weights

a matrix of scores (weights) to be used in the aggregation process. Weights in each row must be ordered either in decreasing or increasing order and must correspond to the elements in x

method

method to be used to perform rank aggregation: Cross Entropy Monte Carlo (CE) or Genetic Algorithm (GA)

distance

distance to be used which "measures" the similarity of ordered lists

seed

a random seed specified for reproducability; default: NULL

maxIter

the maximum number of iterations allowed; default: 1000

convIn

stopping criteria for both CE and GA algorithms. If the best solution does not change in convIn iterations, the algorithm converged; default: 7 for CE, 30 for GA

importance

vector of weights indicating the importance of each list in x; default: a vector of 1's ( equal weights are given to all lists

rho

(rho*N) is the "quantile" of candidate lists sorted by the function values. Used only by the Cross-Entropy algorithm

weight

a learning factor used in the probability update procedure of the CE algorithm

N

a number of samples to be generated by the MCMC; default: 10nk, where n is the number of unique elements in x. Used only by the Cross-Entropy algorithm

v1

optional, can be used to specify the initial probability matrix; if v1=NULL, the initial probability matrix is set to 1/n, where n is the number of unique elements in x

popSize

population size in each generation of Genetic Algorithm; default: 100

CP

Cross-over probability for the GA; the default value is .4

MP

Mutation probability for the GA. This value should be small and the number of mutations in the population of size popSize and the number of features k is computed as popSize*k*MP.

verbose

boolean, if console output is to be displayed at each iteration

...

additional arguments can be passed to the internal procedures:

– p - penalty for the Kendall's tau distance; default: 0

Details

The function performs rank aggregation via the Cross-Entropy Monte Carlo algorithm or the Genetic Algorithm. Both approaches can and should be used when k is relatively large (k > 10). If k is small, one can enumerate all possible candidate lists and find the minimum directly using the BruteAggreg function available in this package.

The Cross-Entropy Monte Carlo algorithm is an iterative procedure for solving difficult combinatorial problems in which it is computationally not feasable to find the solution directly. In the context of rank aggregation, the algorithm searches for the "super"-list which is as close as possible to the ordered lists in x. We use either the Spearman footrule distance or the Kendall's tau to measure the "closeness" of any two ordered lists (or modified by us the weighted versions of these distances). Please refer to the paper in the references for further details.

The Genetic Algorithm requires setting CP and MP parameters which effect the rate of "evolution" in the population. If both CP and MP are small, the algorithms is very conservative and may take a long time to search the solution space of all ordered candidate lists. On the other hand, setting CP and MP (especially MP) large will introduce a large number of mutations in the population which can result in a local optima.

The convergence criteria used by both algorithms is the repetition of the same minimum value of the objective function in convIn consecutive iterations.

Value

top.list

Top-k aggregated list

optimal.value

the minimum value of the objective function corresponding to the top-k list

sample.size

the number of samples generated by the MCMC at each iteration

num.iter

the number of iterations until convergence

method

which algorithm was used

distance

which distance was used

importance

an importance vector used

lists

the original ordered lists

weights

scaled weights if specified

sample

objective function scores from the last iteration

summary

matrix containing minimum and median objective function scores for each iteration

Author(s)

Vasyl Pihur, Somnath Datta, Susmita Datta

References

Pihur, V., Datta, S., and Datta, S. (2007) "Weighted rank aggregation of cluster validation measures: a Monte Carlo cross-entropy approach" Bioinformatics, 23(13):1607-1615

See Also

BruteAggreg, plot

Examples

# rank aggregation without weights
x <- matrix(c("A", "B", "C", "D", "E",
        "B", "D", "A", "E", "C",
        "B", "A", "E", "C", "D",
        "A", "D", "B", "C", "E"), byrow=TRUE, ncol=5)

(CESnoweights <- RankAggreg(x, 5, method="CE", distance="Spearman", N=100, convIn=5, rho=.1))

# weighted rank aggregation
set.seed(100)
w <- matrix(rnorm(20), ncol=5)
w <- t(apply(w, 1, sort))

# using the Cross-Entropy Monte-Carlo algorithm
(CES <- RankAggreg(x, 5, w, "CE", "Spearman", rho=.1, N=100, convIn=5))
plot(CES)
(CEK <- RankAggreg(x, 5, w, "CE", "Kendall", rho=.1, N=100, convIn=5))

# using the Genetic algorithm
(GAS <- RankAggreg(x, 5, w, "GA", "Spearman"))
plot(GAS)
(GAK <- RankAggreg(x, 5, w, "GA", "Kendall"))

# more complex example (to get a better solution, increase maxIter)
data(geneLists)
topGenes <- RankAggreg(geneLists, 25, method="GA", maxIter=100)
plot(topGenes)

Results


R version 3.3.1 (2016-06-21) -- "Bug in Your Hair"
Copyright (C) 2016 The R Foundation for Statistical Computing
Platform: x86_64-pc-linux-gnu (64-bit)

R is free software and comes with ABSOLUTELY NO WARRANTY.
You are welcome to redistribute it under certain conditions.
Type 'license()' or 'licence()' for distribution details.

R is a collaborative project with many contributors.
Type 'contributors()' for more information and
'citation()' on how to cite R or R packages in publications.

Type 'demo()' for some demos, 'help()' for on-line help, or
'help.start()' for an HTML browser interface to help.
Type 'q()' to quit R.

> library(RankAggreg)
> png(filename="/home/ddbj/snapshot/RGM3/R_CC/result/RankAggreg/RankAggreg.Rd_%03d_medium.png", width=480, height=480)
> ### Name: RankAggreg
> ### Title: Weighted Rank Aggregation of partial ordered lists
> ### Aliases: RankAggreg
> ### Keywords: optimize robust
> 
> ### ** Examples
> 
> # rank aggregation without weights
> x <- matrix(c("A", "B", "C", "D", "E",
+         "B", "D", "A", "E", "C",
+         "B", "A", "E", "C", "D",
+         "A", "D", "B", "C", "E"), byrow=TRUE, ncol=5)
> 
> (CESnoweights <- RankAggreg(x, 5, method="CE", distance="Spearman", N=100, convIn=5, rho=.1))

 Iteration 1 :  Optimal value:  4 
 Optimal List:   B,A,D,C,E 

 Iteration 2 :  Optimal value:  4 
 Optimal List:   B,A,D,C,E 

 Iteration 3 :  Optimal value:  4 
 Optimal List:   A,B,D,C,E 

 Iteration 4 :  Optimal value:  4 
 Optimal List:   B,A,D,C,E 

 Iteration 5 :  Optimal value:  4 
 Optimal List:   B,A,D,C,E 
The optimal list is: 
        B A D C E

  Algorithm:   CE
  Distance:    Spearman
  Score:       4 
> 
> # weighted rank aggregation
> set.seed(100)
> w <- matrix(rnorm(20), ncol=5)
> w <- t(apply(w, 1, sort))
> 
> # using the Cross-Entropy Monte-Carlo algorithm
> (CES <- RankAggreg(x, 5, w, "CE", "Spearman", rho=.1, N=100, convIn=5))

 Iteration 1 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 2 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 3 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 4 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 5 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 
The optimal list is: 
        B A D C E

  Algorithm:   CE
  Distance:    Spearman
  Score:       0.8934616 
> plot(CES)
> (CEK <- RankAggreg(x, 5, w, "CE", "Kendall", rho=.1, N=100, convIn=5))

 Iteration 1 :  Optimal value:  0.188298782004424 
 Optimal List:   B,A,C,D,E 

 Iteration 2 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 3 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 4 :  Optimal value:  0.0822102869121649 
 Optimal List:   B,A,D,C,E 

 Iteration 5 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 6 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 7 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 8 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 9 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 
The optimal list is: 
        A B D C E

  Algorithm:   CE
  Distance:    Kendall
  Score:       0.05868012 
> 
> # using the Genetic algorithm
> (GAS <- RankAggreg(x, 5, w, "GA", "Spearman"))

 Iteration 1 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 2 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 3 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 4 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 5 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 6 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 7 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 8 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 9 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 10 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 11 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 12 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 13 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 14 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 15 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 16 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 17 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 18 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 19 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 20 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 21 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 22 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 23 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 24 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 25 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 26 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 27 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 28 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 29 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 

 Iteration 30 :  Optimal value:  0.893461614659207 
 Optimal List:   B,A,D,C,E 
The optimal list is: 
        B A D C E

  Algorithm:   GA
  Distance:    Spearman
  Score:       0.8934616 
> plot(GAS)
> (GAK <- RankAggreg(x, 5, w, "GA", "Kendall"))

 Iteration 1 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 2 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 3 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 4 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 5 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 6 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 7 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 8 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 9 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 10 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 11 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 12 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 13 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 14 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 15 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 16 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 17 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 18 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 19 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 20 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 21 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 22 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 23 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 24 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 25 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 26 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 27 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 28 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 29 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 

 Iteration 30 :  Optimal value:  0.0586801248078654 
 Optimal List:   A,B,D,C,E 
The optimal list is: 
        A B D C E

  Algorithm:   GA
  Distance:    Kendall
  Score:       0.05868012 
> 
> # more complex example (to get a better solution, increase maxIter)
> data(geneLists)
> topGenes <- RankAggreg(geneLists, 25, method="GA", maxIter=100)

 Iteration 1 :  Optimal value:  438.4 
 Optimal List:   DAPK1,CBX3,DYRK1A,CYP1B1,EEF2,AMACR,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,SLC25A6,CKAP1,LMAN1,RPL5,CCND2,STRA13 

 Iteration 2 :  Optimal value:  436.4 
 Optimal List:   DAPK1,CBX3,DYRK1A,CYP1B1,EEF2,AMACR,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,SLC25A6,STRA13,LMAN1,RPL5,CCND2,CKAP1 

 Iteration 3 :  Optimal value:  436.4 
 Optimal List:   DAPK1,CBX3,DYRK1A,CYP1B1,EEF2,AMACR,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,SLC25A6,STRA13,LMAN1,RPL5,CCND2,CKAP1 

 Iteration 4 :  Optimal value:  434.8 
 Optimal List:   MRPL3,CBX3,DYRK1A,CYP1B1,EEF2,AMACR,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,SLC25A6,CKAP1,LMAN1,RPL5,CCND2,STRA13 

 Iteration 5 :  Optimal value:  428.8 
 Optimal List:   0ACT2,CBX3,DYRK1A,CYP1B1,EEF2,AMACR,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,MYC,CKAP1,LMAN1,CALR,CCND2,STRA13 

 Iteration 6 :  Optimal value:  430.4 
 Optimal List:   AMACR,CBX3,DYRK1A,CYP1B1,EEF2,MARCKS,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,SLC25A6,CKAP1,LMAN1,RPL5,TCEB3,STRA13 

 Iteration 7 :  Optimal value:  428 
 Optimal List:   AMACR,CBX3,DYRK1A,CYP1B1,EEF2,MRPL3,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,SLC25A6,CKAP1,LMAN1,RPL5,CCND2,STRA13 

 Iteration 8 :  Optimal value:  428 
 Optimal List:   AMACR,CBX3,DYRK1A,CYP1B1,EEF2,MRPL3,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,SLC25A6,CKAP1,LMAN1,RPL5,CCND2,STRA13 

 Iteration 9 :  Optimal value:  428 
 Optimal List:   AMACR,CBX3,DYRK1A,CYP1B1,EEF2,MRPL3,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,SLC25A6,CKAP1,LMAN1,RPL5,CCND2,STRA13 

 Iteration 10 :  Optimal value:  427.2 
 Optimal List:   FM05,CBX3,SLC25A6,CYP1B1,EEF2,AMACR,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 11 :  Optimal value:  427.2 
 Optimal List:   FM05,CBX3,SLC25A6,CYP1B1,EEF2,AMACR,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 12 :  Optimal value:  420.4 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 13 :  Optimal value:  420.4 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 14 :  Optimal value:  420.4 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,SLC7A5,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 15 :  Optimal value:  416 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,NME1,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 16 :  Optimal value:  416 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,NME1,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 17 :  Optimal value:  416 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,NME1,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 18 :  Optimal value:  416 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,NME1,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 19 :  Optimal value:  416 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,NME1,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 20 :  Optimal value:  412.4 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,HPN,UAP1,ENTPD6,GDF15,SLC7A5,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,RPL5,CCND2,DYRK1A 

 Iteration 21 :  Optimal value:  412.4 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,HPN,UAP1,ENTPD6,GDF15,SLC7A5,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,DYRK1A,RPL5,CCND2,KRT7 

 Iteration 22 :  Optimal value:  416 
 Optimal List:   HPN,CBX3,SLC25A6,CYP1B1,EEF2,MYC,SLC7A5,UAP1,ENTPD6,GDF15,AMACR,GRP58,NACA,GUCY1A3,NME1,SLC19A1,PPIB,PRSS8,JTV1,DYRK1A,CKAP1,TFCP2,RPL5,CCND2,STRA13 

 Iteration 23 :  Optimal value:  414 
 Optimal List:   AMACR,CBX3,SLC25A6,CYP1B1,EEF2,FM05,NME1,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,ALCAM,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,DYRK1A,CKAP1,WT1,RPL5,CCND2,STRA13 

 Iteration 24 :  Optimal value:  404.4 
 Optimal List:   AMACR,NME1,SLC25A6,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,TMEM4,CCND2,DYRK1A 

 Iteration 25 :  Optimal value:  404.4 
 Optimal List:   AMACR,NME1,SLC25A6,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,TMEM4,CCND2,DYRK1A 

 Iteration 26 :  Optimal value:  404.4 
 Optimal List:   AMACR,NME1,SLC25A6,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,TMEM4,CCND2,DYRK1A 

 Iteration 27 :  Optimal value:  404.4 
 Optimal List:   AMACR,NME1,SLC25A6,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,TMEM4,CCND2,DYRK1A 

 Iteration 28 :  Optimal value:  404.4 
 Optimal List:   AMACR,NME1,SLC25A6,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,TMEM4,CCND2,DYRK1A 

 Iteration 29 :  Optimal value:  404.4 
 Optimal List:   AMACR,NME1,SLC25A6,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,0ACT2,CCND2,DYRK1A 

 Iteration 30 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 31 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 32 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 33 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,WT1,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 34 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 35 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 36 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 37 :  Optimal value:  396.8 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,EIF4A1,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 38 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,SLC25A6,FASN,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,KRT18,JTV1,STRA13,CKAP1,LMAN1,TMEM4,TFF3,DYRK1A 

 Iteration 39 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,SLC25A6,FASN,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,KRT18,JTV1,STRA13,CKAP1,LMAN1,TMEM4,TFF3,DYRK1A 

 Iteration 40 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,SLC25A6,FASN,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,HPN,GRP58,NACA,PPIB,SLC7A5,SLC19A1,GUCY1A3,KRT18,JTV1,STRA13,CKAP1,LMAN1,TMEM4,TFF3,DYRK1A 

 Iteration 41 :  Optimal value:  394.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,SAT,JTV1,STRA13,CKAP1,LMAN1,ANK3,TFF3,DYRK1A 

 Iteration 42 :  Optimal value:  395.6 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 43 :  Optimal value:  388.8 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,0ACT2,SLC19A1,PPIB,PRSS8,JTV1,ACADSB,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 44 :  Optimal value:  391.2 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,RAD23B,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 45 :  Optimal value:  391.2 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,RAD23B,SLC19A1,PPIB,PRSS8,JTV1,STRA13,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 46 :  Optimal value:  394.8 
 Optimal List:   AMACR,NACA,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NME1,GUCY1A3,SLC7A5,SLC19A1,PPIB,SAT,JTV1,ACADSB,STRA13,CCND2,ANK3,MAOA,DYRK1A 

 Iteration 47 :  Optimal value:  395.2 
 Optimal List:   AMACR,NACA,HPN,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NME1,GUCY1A3,SLC7A5,KRT7,PPIB,SAT,JTV1,ACADSB,STRA13,CCND2,ANK3,MAOA,DYRK1A 

 Iteration 48 :  Optimal value:  394.8 
 Optimal List:   HPN,NME1,AMACR,KRT18,EEF2,FM05,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 49 :  Optimal value:  392.8 
 Optimal List:   AMACR,CANX,HPN,KRT18,EEF2,FM05,NME2,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,0ACT2,SLC19A1,PPIB,MAOA,JTV1,ACADSB,CKAP1,LMAN1,ANK3,PRSS8,DYRK1A 

 Iteration 50 :  Optimal value:  392.8 
 Optimal List:   AMACR,CANX,HPN,KRT18,EEF2,FM05,NME2,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,0ACT2,SLC19A1,PPIB,MAOA,JTV1,ACADSB,CKAP1,LMAN1,ANK3,PRSS8,DYRK1A 

 Iteration 51 :  Optimal value:  388.8 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,GUCY1A3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,CBX3,0ACT2,SLC19A1,PPIB,DYRK1A,JTV1,ACADSB,CKAP1,LMAN1,ANK3,CCND2,SAT 

 Iteration 52 :  Optimal value:  388.8 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,FM05,GUCY1A3,UAP1,ENTPD6,GDF15,SLC25A6,GRP58,NACA,CBX3,0ACT2,SLC19A1,PPIB,DYRK1A,JTV1,ACADSB,CKAP1,LMAN1,ANK3,CCND2,SAT 

 Iteration 53 :  Optimal value:  385.6 
 Optimal List:   AMACR,NME1,SLC25A6,KRT18,EEF2,0ACT2,CBX3,UAP1,HPN,GDF15,ENTPD6,GRP58,NACA,TRAP1,CCND2,SLC19A1,PPIB,PRSS8,JTV1,STRA13,LGALS3,LMAN1,TMEM4,MARCKS,DYRK1A 

 Iteration 54 :  Optimal value:  386.8 
 Optimal List:   AMACR,NME1,SLC25A6,KRT18,EEF2,0ACT2,CBX3,UAP1,HPN,GDF15,ENTPD6,GRP58,NACA,TRAP1,CCND2,SLC19A1,COX6C,PRSS8,JTV1,STRA13,LGALS3,LMAN1,TMEM4,MARCKS,DYRK1A 

 Iteration 55 :  Optimal value:  385.6 
 Optimal List:   AMACR,NME1,HPN,SLC25A6,EEF2,FM05,CBX3,UAP1,STRA13,GDF15,KRT18,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 56 :  Optimal value:  387.6 
 Optimal List:   AMACR,NME1,HPN,SLC25A6,EEF2,FM05,CBX3,UAP1,LGALS3,GDF15,KRT18,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,STRA13,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,CCND2,DYRK1A 

 Iteration 57 :  Optimal value:  383.6 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 58 :  Optimal value:  383.6 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 59 :  Optimal value:  384 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 60 :  Optimal value:  382.8 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,TMEM4,G3BP,DYRK1A 

 Iteration 61 :  Optimal value:  382.8 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,ENTPD6,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,TMEM4,G3BP,DYRK1A 

 Iteration 62 :  Optimal value:  382 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,STRA13,GDF15,SLC25A6,GRP58,NACA,GUCY1A3,SLC7A5,SLC19A1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,DYRK1A,MARCKS,CCND2,LMAN1 

 Iteration 63 :  Optimal value:  380.8 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,RPL36AL,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,0ACT2,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 64 :  Optimal value:  376.4 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,NME1,GDF15,SLC25A6,ENTPD6,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 65 :  Optimal value:  375.6 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,NME1,GDF15,SLC25A6,ENTPD6,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,0ACT2,DYRK1A 

 Iteration 66 :  Optimal value:  375.6 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,NME1,GDF15,SLC25A6,ENTPD6,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,0ACT2,DYRK1A 

 Iteration 67 :  Optimal value:  373.6 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 68 :  Optimal value:  375.6 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 69 :  Optimal value:  375.6 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 70 :  Optimal value:  375.6 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 71 :  Optimal value:  375.6 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 72 :  Optimal value:  374.4 
 Optimal List:   AMACR,NME1,HPN,KRT18,EEF2,ALCAM,STRA13,GDF15,CCNG2,UAP1,SLC25A6,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,SND1,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 73 :  Optimal value:  374 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,NME1,GDF15,SLC25A6,ENTPD6,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,0ACT2,LMAN1,ANK3,PRKACA,DYRK1A 

 Iteration 74 :  Optimal value:  371.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 75 :  Optimal value:  371.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 76 :  Optimal value:  371.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 77 :  Optimal value:  371.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 78 :  Optimal value:  371.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 79 :  Optimal value:  371.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,GUCY1A3,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 80 :  Optimal value:  369.2 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,GUCY1A3,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,ALCAM,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 81 :  Optimal value:  369.2 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,GUCY1A3,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,ALCAM,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 82 :  Optimal value:  369.2 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ANK3,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,ALCAM,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,GUCY1A3,G3BP,DYRK1A 

 Iteration 83 :  Optimal value:  366.8 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,GUCY1A3,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,ALCAM,ENTPD6,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 84 :  Optimal value:  366.8 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,GUCY1A3,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,ALCAM,ENTPD6,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 85 :  Optimal value:  366.8 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,GUCY1A3,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,ALCAM,ENTPD6,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 86 :  Optimal value:  369.2 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,CBX3,UAP1,NME1,ALCAM,SLC25A6,ENTPD6,NACA,GUCY1A3,LGALS3,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,PRKACA,DYRK1A 

 Iteration 87 :  Optimal value:  369.2 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ANK3,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,ALCAM,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,DDB2,CKAP1,LMAN1,GUCY1A3,G3BP,DYRK1A 

 Iteration 88 :  Optimal value:  367.6 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,CBX3,UAP1,NME1,ALCAM,SLC25A6,ENTPD6,NACA,GUCY1A3,LGALS3,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,ANK3,LMAN1,NME2,PRKACA,DYRK1A 

 Iteration 89 :  Optimal value:  367.6 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,CBX3,UAP1,NME1,ALCAM,SLC25A6,ENTPD6,NACA,GUCY1A3,LGALS3,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,ANK3,LMAN1,NME2,PRKACA,DYRK1A 

 Iteration 90 :  Optimal value:  367.6 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,CBX3,UAP1,NME1,ALCAM,SLC25A6,ENTPD6,NACA,GUCY1A3,LGALS3,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,ANK3,LMAN1,NME2,PRKACA,DYRK1A 

 Iteration 91 :  Optimal value:  367.6 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,CBX3,UAP1,NME1,ALCAM,SLC25A6,ENTPD6,NACA,GUCY1A3,LGALS3,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,ANK3,LMAN1,NME2,PRKACA,DYRK1A 

 Iteration 92 :  Optimal value:  367.6 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,CBX3,UAP1,NME1,ALCAM,SLC25A6,ENTPD6,NACA,GUCY1A3,LGALS3,CYP1B1,PPIB,PRSS8,JTV1,MTHFD2,ANK3,LMAN1,NME2,PRKACA,DYRK1A 

 Iteration 93 :  Optimal value:  367.2 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CBX3,UAP1,0ACT2,GDF15,NME1,FASN,NACA,LDHA,TNFSF10,CYP1B1,PPIB,PRSS8,JTV1,DDB2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 94 :  Optimal value:  365.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CANX,UAP1,0ACT2,GDF15,NME1,FASN,NACA,LDHA,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 95 :  Optimal value:  365.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CANX,UAP1,0ACT2,GDF15,NME1,FASN,NACA,LDHA,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 96 :  Optimal value:  365.6 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CANX,UAP1,0ACT2,GDF15,NME1,FASN,NACA,LDHA,SLC7A5,CYP1B1,PPIB,RPL36AL,JTV1,MTHFD2,CKAP1,LMAN1,ANK3,G3BP,DYRK1A 

 Iteration 97 :  Optimal value:  364.8 
 Optimal List:   AMACR,SLC25A6,HPN,KRT18,EEF2,ALCAM,CBX3,0ACT2,UAP1,GDF15,NME1,FASN,NACA,LDHA,LGALS3,CYP1B1,PPIB,RPL36AL,JTV1,MTHFD2,CKAP1,FM05,ANK3,G3BP,DYRK1A 

 Iteration 98 :  Optimal value:  362 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,0ACT2,UAP1,NME1,ALCAM,CYP1B1,ENTPD6,NACA,GUCY1A3,LGALS3,SLC25A6,PPIB,PRSS8,JTV1,MTHFD2,ANK3,LMAN1,NME2,G3BP,DYRK1A 

 Iteration 99 :  Optimal value:  359.2 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,0ACT2,UAP1,NME1,ALCAM,CYP1B1,ENTPD6,NACA,GUCY1A3,LGALS3,SLC25A6,PPIB,PRSS8,SND1,MTHFD2,ANK3,LMAN1,NME2,G3BP,DYRK1A 

 Iteration 100 :  Optimal value:  359.2 
 Optimal List:   AMACR,FASN,HPN,KRT18,EEF2,GDF15,0ACT2,UAP1,NME1,ALCAM,CYP1B1,ENTPD6,NACA,GUCY1A3,LGALS3,SLC25A6,PPIB,PRSS8,SND1,MTHFD2,ANK3,LMAN1,NME2,G3BP,DYRK1A 
Did not converge after  100  iterations.
> plot(topGenes)
> 
> 
> 
> 
> 
> dev.off()
null device 
          1 
>


Created & Maintained by Osamu Ogasawara (osamu.ogasawara@gmail.com) and IMSBIO