Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks

  • Jacob Scott
  • Trey Ideker
  • Richard M. Karp
  • Roded Sharan
Conference paper

DOI: 10.1007/11415770_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3500)
Cite this paper as:
Scott J., Ideker T., Karp R.M., Sharan R. (2005) Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks. In: Miyano S., Mesirov J., Kasif S., Istrail S., Pevzner P.A., Waterman M. (eds) Research in Computational Molecular Biology. RECOMB 2005. Lecture Notes in Computer Science, vol 3500. Springer, Berlin, Heidelberg

Abstract

The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here we adapt and extend efficient techniques for finding paths in graphs to the problem of identifying pathways in protein interaction networks. We present linear-time algorithms for finding paths 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 in an unsupervised manner. The algorithm is very efficient, computing optimal paths of length 8 within minutes and paths of length 10 in less than two hours.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jacob Scott
    • 1
  • Trey Ideker
    • 2
  • Richard M. Karp
    • 3
  • Roded Sharan
    • 4
  1. 1.Computer Science DivisionU. C. BerkeleyBerkeleyUSA
  2. 2.Dept. of BioengineeringU. C. San DiegoLa JollaUSA
  3. 3.International Computer Science InstituteBerkeleyUSA
  4. 4.School of Computer ScienceTel-Aviv UniversityTel-AvivIsrael

Personalised recommendations