Polynomial preconditioning for the generank problem
Electronic transactions on numerical analysis, Tome 41 (2014), pp. 179-189
Identifying key genes involved in a particular disease is a very important problem in biomedical research. The GeneRank model is based on the PageRank algorithm and shares many of its mathematical properties. The model brings together gene expression information with a network structure and ranks genes based on the results of microarray experiments combined with gene expression information, for example, from gene annotations (GO). In this study, we present a polynomial preconditioned conjugate gradient algorithm to solve the GeneRank problem and study its properties. Some numerical experiments are given to show the effectiveness of the suggested preconditioner.
Classification :
65F10, 65F50, 92D20
Keywords: gene network, gene ontologies, conjugate gradient, Chebyshev polynomial, preconditioner, M-matrix
Keywords: gene network, gene ontologies, conjugate gradient, Chebyshev polynomial, preconditioner, M-matrix
@article{ETNA_2014__41__a14,
author = {Salkuyeh, Davod Khojasteh and Edalatpour, Vahid and Hezari, Davod},
title = {Polynomial preconditioning for the generank problem},
journal = {Electronic transactions on numerical analysis},
pages = {179--189},
year = {2014},
volume = {41},
zbl = {1298.92077},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_2014__41__a14/}
}
TY - JOUR AU - Salkuyeh, Davod Khojasteh AU - Edalatpour, Vahid AU - Hezari, Davod TI - Polynomial preconditioning for the generank problem JO - Electronic transactions on numerical analysis PY - 2014 SP - 179 EP - 189 VL - 41 UR - http://geodesic.mathdoc.fr/item/ETNA_2014__41__a14/ LA - en ID - ETNA_2014__41__a14 ER -
Salkuyeh, Davod Khojasteh; Edalatpour, Vahid; Hezari, Davod. Polynomial preconditioning for the generank problem. Electronic transactions on numerical analysis, Tome 41 (2014), pp. 179-189. http://geodesic.mathdoc.fr/item/ETNA_2014__41__a14/