Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks
By Jacob Scott, Trey Ideker, Richard M. Karp, Roded Sharan. Annual International Conference on Research in Computational Molecular Biology, 2005
300 citations recorded by the source corpus.
Subfields: Molecular Biology
View Paper: https://www.semanticscholar.org/paper/7e5507e3d0549eb7e3a4de4780e0bc92c557148c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Molecular Biology
- Roded Sharan
- Igor Ulitsky
- Ron Shamir
- Anne-Ruxandra Carvunis
- Trey Ideker
- S. Ramesh
- Koyel Mitra
- Anastasia Baryshnikova
Citations in the corpus
- Network-based prediction of protein function (2007, background): “The purpose of some algorithms is the detection of molecular complexes, but others can also detect sparser structures, such as signaling pathways (Steffen et al , 2002; Yeang et al , 2005; Scott et al , 2006).”
- Integrative approaches for finding modular structure in biological networks (2013, methodology): “Different scoring functions have assumed scores on network nodes 48 or edges 41,58 or both 59 ; or constrained scores by network topology 56 or signal content 44 ; or are prioritized by high-scoring ‘seed’ nodes 60 , including using strategies for computational colour coding of ‘seed’ paths 51,55 .”
- Protein networks in disease. (2008, methodology): “Beyond enriched motifs, methods have been devised to identify all sorts of network structures, such as densely connected network regions (for review, see Brohee and van Helden 2006), which are suggestive of protein complexes, and paths of interactions connecting membrane proteins to transcription fa”