The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gene Ontology: tool for the unification of biology
Ashburner, M., Ball, C. A., Blake, J. A., Botstein, D., Butler, H., Cherry, J. M., Davis, A. P., Dolinski, K., Dwight, S. S., Eppig, J. T., et al. (2000) · Nature Genetics · doi:10.1038/75556 · Cited by 43,206
Comparative assessment of large-scale data sets of protein–protein interactions
von Mering, C., Krause, R., Snel, B., Cornell, M., Oliver, S. G., Fields, S., & Bork, P. (2002) · Nature · doi:10.1038/nature750 · Cited by 2,365
Xenarios, I. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.1.303 · Cited by 1,741
Alon, N., Yuster, R., & Zwick, U. (1995) · Journal of the ACM · doi:10.1145/210332.210337 · Cited by 1,002
Roberts, C. J., Nelson, B., Marton, M. J., Stoughton, R., Meyer, M. R., Bennett, H. A., He, Y. D., Dai, H., Walker, W. L., Hughes, T. R., et al. (2000) · Science · doi:10.1126/science.287.5454.873 · Cited by 855
Conserved patterns of protein interaction in multiple species
Sharan, R., Suthram, S., Kelley, R. M., Kuhn, T., McCuine, S., Uetz, P., Sittler, T., Karp, R. M., & Ideker, T. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0409522102 · Cited by 796
Self-citationMIPS: analysis and annotation of proteins from whole genomes
Mewes, H. W. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh092 · Cited by 713
Conserved pathways within bacteria and yeast as revealed by global protein network alignment
Kelley, B. P., Sharan, R., Karp, R. M., Sittler, T., Root, D. E., Stockwell, B. R., & Ideker, T. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1534710100 · Cited by 529
Self-citationGaining confidence in high-throughput protein interaction networks
Bader, J. S., Chaudhuri, A., Rothberg, J. M., & Chant, J. (2004) · Nature Biotechnology · doi:10.1038/nbt924 · Cited by 467
Assessing experimentally derived interactions in a small world
Goldberg, D. S., & Roth, F. P. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0735871100 · Cited by 400
The Stanford Microarray Database: data access and quality assessment tools
Gollub, J. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg078 · Cited by 327
Whole-genome annotation by using evidence integration in functional-linkage networks
Karaoz, U., Murali, T. M., Letovsky, S., Zheng, Y., Ding, C., Cantor, C. R., & Kasif, S. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307326101 · Cited by 315
Automated modelling of signal transduction networks
Steffen, M., Petti, A., Aach, J., D'haeseleer, P., & Church, G. (2002) · BMC Bioinformatics · doi:10.1186/1471-2105-3-34 · Cited by 226
Pattern and Timing of Gene Duplication in Animal Genomes
Friedman, R., & Hughes, A. L. (2001) · Genome Research · doi:10.1101/gr.200601 · Cited by 200
Cited by
Network‐based prediction of protein function
Sharan, R., Ulitsky, I., & Shamir, R. (2007) · Molecular Systems Biology · doi:10.1038/msb4100129 · Cited by 1,074
Self-citationIdeker, T., & Sharan, R. (2008) · Genome Research · doi:10.1101/gr.071852.107 · Cited by 817
Self-citationIntegrative approaches for finding modular structure in biological networks
Mitra, K., Carvunis, A.-R., Ramesh, S. K., & Ideker, T. (2013) · Nature Reviews Genetics · doi:10.1038/nrg3552 · Cited by 535
Self-citationLiu, R., Wang, X., Aihara, K., & Chen, L. (2014) · Medicinal Research Reviews · doi:10.1002/med.21293 · Cited by 333
Toward the dynamic interactome: it's about time
Przytycka, T. M., Singh, M., & Slonim, D. K. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbp057 · Cited by 254
Metadata
- Authors
- Scott, J., Ideker, T., Karp, R. M., & Sharan, R.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 2006-03
- Volume
- 13
- Issue
- 2
- Pages
- 133-144
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W2003652380
- Cited by
- 269
- References
- 14
- FWCI
- 9.58
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.