Journal
JOURNAL OF COMPUTATIONAL BIOLOGY
Volume 13, Issue 2, Pages 133-144Publisher
MARY ANN LIEBERT, INC
DOI: 10.1089/cmb.2006.13.133
Keywords
protein interaction network; signaling pathway; color coding; randomized algorithms
Ask authors/readers for more resources
The interpretation of large-scale protein network data depends on our ability to identify significant substructures in the data, a computationally intensive task. Here we adapt and extend efficient techniques for finding paths and trees in graphs to the problem of identifying pathways in protein interaction networks. We present linear-time algorithms for finding paths and trees in networks under several biologically motivated constraints. We apply our methodology to search for protein pathways in the yeast protein-protein interaction network. We demonstrate that our algorithm is capable of reconstructing known signaling pathways and identifying functionally enriched paths and trees in an unsupervised manner. The algorithm is very efficient, computing optimal paths of length 8 within minutes and paths of length 10 in about three hours.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available