Abstract
In this paper, we consider the problem of reconstructing a pathway for a given set of proteins based on available genomics and proteomics information such as gene expression data. In all previous approaches, the scoring function for a candidate pathway usually only depends on adjacent proteins in the pathway. We propose to also consider proteins that are of distance two in the pathway (we call them Level-2 neighbours). We derive a scoring function based on both adjacent proteins and Level-2 neighbours in the pathway and show that our scoring function can increase the accuracy of the predicted pathways through a set of experiments. The problem of computing the pathway with optimal score, in general, is NP-hard. We thus extend a randomised algorithm to make it work on our scoring function to compute the optimal pathway with high probability.
Original language | English |
---|---|
Pages (from-to) | 542-555 |
Number of pages | 14 |
Journal | International Journal of Bioinformatics Research and Applications |
Volume | 6 |
Issue number | 6 |
DOIs | |
Publication status | Published - 2010 |