Probabilistic path ranking based on adjacent pairwise coexpression for metabolic transcripts analysis.
BACKGROUND
Pathway knowledge in public databases enables us to examine how individual metabolites are connected via chemical reactions and what genes are implicated in those processes. For two given (sets of) compounds, the number of possible paths between them in a metabolic network can be intractably large. It would be informative to rank these paths in order to differentiate between them.


RESULTS
Focusing on adjacent pairwise coexpression, we developed an algorithm which, for a specified k, efficiently outputs the top k paths based on a probabilistic scoring mechanism, using a given metabolic network and microarray datasets. Our idea of using adjacent pairwise coexpression is supported by recent studies that local coregulation is predominant in metabolism. We first evaluated this idea by examining to what extent highly correlated gene pairs are adjacent and how often they are consecutive in a metabolic network. We then applied our algorithm to two examples of path ranking: the paths from glucose to pyruvate in the entire metabolic network of yeast and the paths from phenylalanine to sinapyl alcohol in monolignols pathways of arabidopsis under several different microarray conditions, to confirm and discuss the performance analysis of our method.
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto 611-0011, Japan. takigawa@kuicr.kyoto-u.ac.jp
Ichigaku
I
Takigawa
Hiroshi
H
Mamitsuka
D000465:Algorithms; D003198:Computer Simulation; D003627:Data Interpretation, Statistical; D015870:Gene Expression / Q000502:physiology; D020869:Gene Expression Profiling / Q000379:methods*; D008954:Models, Biological; D015233:Models, Statistical; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D025941:Protein Interaction Mapping / Q000379:methods*; D015398:Signal Transduction / Q000502:physiology*; D014157:Transcription Factors / Q000378:metabolism*
D014157:Transcription Factors