Skip to content
naulon

No retraction, correction or concern found when last checked on Oct 15, 2026.

STRING v11: protein–protein association networks with increased coverage, supporting functional discovery in genome-wide experimental datasets

Damian Szklarczyk, Annika L Gable, David Lyon and 9 more (opens in a new tab)

Nucleic Acids Research · 2018 · CC BY

doi:10.1093/nar/gky1131 (opens in a new tab)

Abstract

Proteins and their functional interactions form the backbone of the cellular machinery. Their connectivity network needs to be considered for the full understanding of biological phenomena, but the available information on protein-protein associations is incomplete and exhibits varying levels of annotation granularity and reliability. The STRING database aims to collect, score and integrate all publicly available sources of protein-protein interaction information, and to complement these with computational predictions. Its goal is to achieve a comprehensive and objective global network, including direct (physical) as well as indirect (functional) interactions. The latest version of STRING (11.0) more than doubles the number of organisms it covers, to 5090. The most important new feature is an option to upload entire, genome-wide datasets as input, allowing users to visualize subsets as interaction networks and to perform gene-set enrichment analysis on the entire input. For the enrichment analysis, STRING implements well-known classification systems such as Gene Ontology and KEGG, but also offers additional, new classification systems based on high-throughput text-mining as well as on a hierarchical clustering of the association network itself. The STRING resource is available online at https://string-db.org/.

Full text

From PubMed Central, U.S. National Library of Medicine, as current on Oct 15, 2026. Paragraph numbers are ours, so an answer can point at one.

INTRODUCTION

While an impressive amount of structural and functional information on individual proteins has been amassed, our knowledge about their interactions remains more fragmented. Some interactions are quite well documented and understood, for example in the context of three-dimensional reconstructions of large cellular machineries, while others are only hinted at so far, through indirect evidence such as genetic observations or statistical predictions. Furthermore, the space of potential protein–protein interactions is much larger, and also more context-dependent, than the space of intrinsic molecular function of individual molecules. Interactions may not only be limited to certain cell types or certain physiological conditions, but their specificity and strength may vary as well, from obligatory, highly specific and stable bindings to more fleeting and relatively unspecific encounters. From a purely functional perspective, proteins can even interact specifically without touching at all, such as when a transcription factor helps to regulate the expression and production of another protein, or when two enzymes exchange a specific substrate via diffusion.

Arguably, the common denominator of the various forms of protein–protein associations is information flow—biologically meaningful interfaces have evolved to allow the flow of information through the cell, and they are ultimately essential for implementing a functional system. Hence, it is desirable to collect and integrate all types of protein–protein interactions under one framework; this then provides support for data analysis pipelines in diverse areas, ranging from disease module identification to biomarker discovery and allows manual browsing, ad hoc discovery and annotation.

Protein–protein interactions can be collected from a number of online databases (reviewed in), as well as from individual high-throughput efforts, e.g.. Primary interaction databases are jointly annotating experimental interaction evidence directly from the source publications, and they are coordinating their efforts through the IMEx consortium. They provide highly valuable added services such as curating metadata, maintaining common name spaces and devising ontologies and standards. A second source of protein–protein interaction information is provided by computational prediction efforts, some of which are hosted by dedicated databases, e.g.. Lastly, a third class of databases is dedicated to protein interactions at the widest scope, integrating both primary as well as predicted interactions, often including annotated pathway knowledge, text-mining results, inter-organism transfers or other accessory information. The STRING database (‘Search Tool for Retrieval of Interacting Genes/Proteins’) belongs to this latter class, along with GeneMania, FunCoup, I2D, ConsensusPathDb, IMP and HumanNet—most of which have recently been reviewed and benchmarked in.

STRING is one of the earliest efforts and strives to differentiate itself mainly through (i) high coverage, (ii) ease of use and (iii) a consistent scoring system. It currently features the largest number of organisms (5090) and proteins (24.6 million), has very broad and diverse, benchmarked data sources and provides intuitive and fast viewers for online use. It also features a number of additional data access points, such as programmatic access through an API, access through a Cytoscape app (http://apps.cytoscape.org/apps/stringapp), as well as download pages covering individual species networks and associated data. The website allows users to log on and store their searches and gene sets, and contains evidence viewers to inspect the underlying evidence of any given interaction. It also provides users with high-level information regarding their input/search data, including network enrichment statistics and functional enrichment detection, using two different conceptual frameworks for the latter (see below). Many of the features of STRING have been made available and described earlier and the website is currently accessed by around 3500 distinct users daily; its hosting facilities have recently been replicated and placed under a commercial load balancer, to provide added stability and capacity. Users can submit multiple proteins simultaneously and visualize large networks; the Cytoscape stringApp can even handle network sizes of several thousand proteins. STRING shares its genome-, protein- and name spaces with a number of sister projects, dedicated to orthology (eggNOG), small molecules (STITCH), protein abundances (PaxDB), tissue expression (TISSUES) and viruses (Viruses.STRING), respectively.

Together with other online resources (including the IMEx consortium, which is one of STRING’s largest primary data sources), the STRING database has recently been awarded the status of a European Core Data Resource by ELIXIR, a pan-European bioinformatics initiative dedicated to sustainable bioinformatics infrastructure. As a prerequisite and consequence of this status, all interaction data and accessory information in STRING are now freely available without restrictions, under the Creative Commons Attribution (CC BY) 4.0 license.

DATABASE CONTENT

The basic interaction unit in STRING is the ‘functional association’, i.e. a link between two proteins that both contribute jointly to a specific biological function. For two proteins to be associated this way, they do not need to interact physically. Instead, it is sufficient if at least some part of their functional roles in the cell overlap—and this overlapping function should be specific enough to broadly qualify as a pathway or functional map (in contrast, merely sharing ‘metabolism’ as an overlapping function would be too unspecific). By this definition, even proteins that antagonize each other can be functionally associated, such as an inhibitor and an activator within the same pathway. The desired specificity cutoff for functional associations in STRING roughly corresponds to the annotation granularity of KEGG pathway maps, whereby maps that largely group proteins by homology (such as ‘ABC transporters’) are removed from consideration.

All of the association evidence in the STRING database is categorized into one of seven independent ‘channels’: three prediction channels based on genomic context information (see below), and one channel each for (i) co-expression, (ii) text-mining, (iii) biochemical/genetic data (‘experiments’) and (iv) previously curated pathway and protein-complex knowledge (‘databases’). Users can disable all channels individually or in combinations. For each channel, separate interaction scores are available as well as viewers for inspecting the underlying evidence (Figure 1). In general, the interaction scores in STRING do not represent the strength or specificity of a given interaction, but instead are meant to express an approximate confidence, on a scale of zero to one, of the association being true, given all the available evidence. The scores in STRING are benchmarked using the subset of associations for which both protein partners are already functionally annotated; for this, the KEGG pathway maps are used as a gold standard and they thus implicitly also determine the granularity of the functional associations.

Within each channel, the evidence is further subdivided into two sub-scores, one of which represents evidence stemming from the organism itself, and the other represents evidence transferred from other organisms. For the latter transfer, the ‘interolog’ concept is applied; STRING uses hierarchically arranged orthologous group relations as defined in eggNOG, in order to transfer associations between organisms where applicable (described in).

The individual protein associations in the various channels are derived, briefly, as follows:

The three genomic context prediction channels (neighborhood, fusion, gene co-occurrence) are the result of systematic all-against-all genome comparisons, aiming to assess the consequences of past genome rearrangements, gene gains and losses, as well as gene fusion events. These evolutionary events are known to be retained non-randomly with respect to the functional roles of genes, and thus allow the inference of functional associations between genes even for otherwise rarely studied organisms (genomic context techniques are reviewed in).

The co-expression channel is based on gene-by-gene correlation tests across a large number of gene expression datasets (using both transcriptome measurements as well as proteome measurements). In the case of transcript data, STRING re-processes and maps the large number of experiments stored in the NCBI Gene Expression Omnibus, followed by normalization, redundancy reduction and Pearson correlation (described in). For version 11, we have further improved the RNAseq co-expression inference pipeline. This was achieved by processing a higher number of RNAseq samples and using the robust biweight midcorrelation. In addition to NCBI Geo, for a subset of species, gene count data was downloaded from the ARCHS4 and ARCHS4 zoo collections.

Protein-based co-expression analysis is new in version 11 of STRING, and as of now it is restricted to one dataset imported as is: namely the ProteomeHD dataset of the Juri Rappsilber lab (unpublished, https://www.proteomehd.net/), covering 294 biological conditions measured using SILAC in human cells. ProteomeHD is not based on Pearson correlation, but instead uses the treeClust algorithm; for STRING, the results of this algorithm are recalibrated and scored using the KEGG benchmark. Each ProteomeHD-provided interaction features a cross-link through which the underlying evidence can be inspected at the ProteomeHD website.

For the experiments channel, all interaction records from the IMEx databases (plus BioGRID), are re-mapped and re-processed: first, duplicate records and datasets are removed, and then entire groups of records are benchmarked against KEGG and scored accordingly.

The database channel is based on manually curated interaction records assembled by expert curators, at KEGG, Reactome, BioCyc and Gene Ontology, as well as legacy datasets from PID and BioCarta. STRING only retains associations between direct pathway members or within protein complexes. The database channel is the only channel for which score calibration does not apply; instead, all associations in this channel receive a high, uniform score (0.900).

At last, for the text-mining channel, STRING conducts statistical co-citation analysis across a large number of scientific texts, including all PubMed abstracts as well as OMIM. Since version 10.5 of STRING, the text corpus also contains a subset of full-text articles. For version 11.0, the Medline abstracts (last updated on 9 June 2018) were complemented with open access as well as author-manuscript full text articles available from PMC in BioC XML format (https://arxiv.org/abs/1804.05957) (last updated on 17 April 2018). Full-text articles that were not classified as English-language articles were removed (using fastText and a pretrained language identification model for 176 languages (https://arxiv.org/abs/1607.01759)), as were those that could not be mapped to PubMed. We also removed highly unspecific articles that mention more than 200 relevant biomedical entities such as proteins, chemicals, diseases or tissues. The final corpus consists of 28 579 637 scientific publications, of which 2 106 542 are available as full-text articles and the remainder as abstracts. While the text-mining pipeline itself has remained unchanged (last described in), its dictionary of gene and protein names has been updated to the new set of genomes and the stop-word list improved to increase precision, especially for human proteins.

NEW ENRICHMENT DETECTION MODE

For users that query the STRING database with a set of proteins (as opposed to a single query protein only), the website computes a functional enrichment analysis in the background; this can then be inspected and browsed by the user, and includes interactive projections of the results onto the user's protein network. This functionality has been available since version 9.1, and is based on straightforward over-representation analysis using hypergeometric tests.

However, this analysis uses only a small part of the information that the user might have about his or her protein list. First, the original list of proteins might have been much longer, and the user would have had to truncate it (thus far, STRING enforced an upper limit on the number of query items). Second, the list might have had a biologically meaningful ranking, which would have been lost during submission to STRING. Third, each protein might have been associated with some numerical information from the underlying experiment or study (such as a log fold change, a measured abundance, a phenotypic outcome, etc.). For this type of genome-wide measurements, simple overlap-based over-representation analysis is not the best choice.

Thus, beginning with version 11.0, STRING offers such users a second option for conducting enrichment analysis. It specifically asks for genome-scale input, with each protein or gene having an associated numerical value (a measurement or statistical metric). Of the available methods for searching functional enrichments in such a set, we chose a permutation-based, non-parametric test that performs well in a number of settings, termed ‘Aggregate Fold Change’. Briefly, this test works by computing, for each gene set to be tested, the average of all values provided by the user for the constituent genes. This average is then compared against averages of randomized gene sets of the same size. Multiple testing correction is applied separately within each functional classification framework (GO, KEGG, InterPro, etc.), according to Benjamini and Hochberg, but not across these frameworks as there is significant overlap between them. For large gene sets, the AFC randomization method becomes prohibitively slow; these gene sets are instead tested after converting the user-provided gene values to ranks, using two-sided Kolmogorov–Smirnov testing. In addition to the usually applied functional classification frameworks, STRING uses two additional systems, thus giving users more options and potentially more novelty for discovery. The first is based on a hierarchical clustering of the STRING network itself. This assumes that tightly connected modules within the network broadly correspond to functional units, and has the advantage that it covers a broader scope and potentially also novel modules that may not yet be annotated as pathways. The clustering is based on a confidence diffusion state distance matrix computed on the full, organism-wide STRING network, which is clustered hierarchically using HPC-CLUST with average linkage. To compute the DSD matrix, the final, combined STRING-score between proteins is used, and the DSD algorithm is run with default parameters and the ‘-c’ flag (confidence). Following the clustering procedure, all clusters with sizes between 5 and 200 are included in the functional enrichment testing, and reported under their own, separate classification category. The second additional set for enrichment testing consists of all published papers mapping to the genes in the user’s input. This takes advantage of STRING’s text-mining channel, for which all of PubMed’s abstract and some additional scientific text are already mapped onto STRING’s protein space (based on identifier matches in the text). Detecting publications that are enriched in the user-input ranking provides yet another complementary way of interpreting the input, often with a more fine-grained view.

Following the computation of the entire new enrichment option, users are presented with a three-panel view of the results (Figure 2). There, each enriched functional subset can be highlighted, and tracked back to the user's input as well as to a pre-rendered, organism-wide STRING network. The layout of the latter is based on a t-SNE-visualization of the network and can be zoomed and panned interactively.

OUTLOOK

Over the coming years, the STRING team aims to continue tracking all available protein association evidence types and prediction algorithms. One particular focus will be to expand the protein-based co-expression channel, where advances in proteomics throughput and scope lead us to expect growing data support for association searches. With regard to the STRING website, we expect to provide tighter integration of functional enrichment and network search results, and are exploring options to provide more context on the various networks (such as cell type, tissues, organelles). We will also strive to provide better interoperability options and increase our list of partnered, crosslinked resources as well as applicable direct data import options to facilitate our regular data updates.

References 62

  1. 1.
  2. 2.

    Uhlen M., Oksvold P., Fagerberg L., Lundberg E., Jonasson K., Forsberg M., Zwahlen M., Kampf C., Wester K., Hober S. Towards a Knowledge-Based human protein atlas. Nat. Biotechnol.2010; 28:1248–1250.

    Not in our library10.1038/nbt1210-1248 (opens in a new tab)

  3. 3.
  4. 4.

    Ban N., Nissen P., Hansen J., Moore P.B., Steitz T.A. The complete atomic structure of the large ribosomal subunit at 2.4 A resolution. Science. 2000; 289:905–920.

    Not in our library10.1126/science.289.5481.905 (opens in a new tab)

  5. 5.

    Schuller J.M., Falk S., Fromm L., Hurt E., Conti E. Structure of the nuclear exosome captured on a maturing preribosome. Science. 2018; 360:219–222.

    Not in our library10.1126/science.aar5428 (opens in a new tab)

  6. 6.

    Marsh J.A., Teichmann S.A. Structure, dynamics, assembly, and evolution of protein complexes. Annu. Rev. Biochem.2015; 84:551–575.

    Not in our library10.1146/annurev-biochem-060614-034142 (opens in a new tab)

  7. 7.

    Huang J.K., Carlin D.E., Yu M.K., Zhang W., Kreisberg J.F., Tamayo P., Ideker T. Systematic evaluation of molecular networks for discovery of disease genes. Cell Syst.2018; 6:484–495.

    Not in our library10.1016/j.cels.2018.03.001 (opens in a new tab)

  8. 8.

    Khurana V., Peng J., Chung C.Y., Auluck P.K., Fanning S., Tardiff D.F., Bartels T., Koeva M., Eichhorn S.W., Benyamini H. Genome-scale networks link neurodegenerative disease genes to alpha-Synuclein through specific molecular pathways. Cell Syst.2017; 4:157–170.

    Not in our library10.1016/j.cels.2016.12.011 (opens in a new tab)

  9. 9.

    Hayashida M., Akutsu T. Complex network-based approaches to biomarker discovery. Biomark. Med.2016; 10:621–632.

    Not in our library10.2217/bmm-2015-0047 (opens in a new tab)

  10. 10.

    Chuang H.Y., Lee E., Liu Y.T., Lee D., Ideker T. Network-based classification of breast cancer metastasis. Mol. Syst. Biol.2007; 3:140.

    Not in our library10.1038/msb4100180 (opens in a new tab)

  11. 11.
  12. 12.

    Gemovic B., Sumonja N., Davidovic R., Perovic V., Veljkovic N. Mapping of Protein-Protein interactions: Web-Based resources for revealing interactomes. Curr. Med. Chem.2018; doi:10.2174/0929867325666180214113704.

    Not in our library10.2174/0929867325666180214113704 (opens in a new tab)

  13. 13.

    Sowmya G., Ranganathan S. Protein-protein interactions and prediction: a comprehensive overview. Protein Pept. Lett.2014; 21:779–789.

    Not in our library10.2174/09298665113209990056 (opens in a new tab)

  14. 14.
  15. 15.

    Salwinski L., Miller C.S., Smith A.J., Pettit F.K., Bowie J.U., Eisenberg D. The database of interacting proteins: 2004 update. Nucleic Acids Res.2004; 32:D449–D451.

    Not in our library10.1093/nar/gkh086 (opens in a new tab)

  16. 16.
  17. 17.

    Chatr-Aryamontri A., Oughtred R., Boucher L., Rust J., Chang C., Kolas N.K., O’Donnell L., Oster S., Theesfeld C., Sellam A. The BioGRID interaction database: 2017 update. Nucleic Acids Res.2017; 45:D369–D379.

    Not in our library10.1093/nar/gkw1102 (opens in a new tab)

  18. 18.
  19. 19.

    Orchard S., Kerrien S., Abbani S., Aranda B., Bhate J., Bidwell S., Bridge A., Briganti L., Brinkman F.S., Cesareni G. Protein interaction data curation: the International Molecular Exchange (IMEx) consortium. Nat. Methods. 2012; 9:345–350.

    Not in our library10.1038/nmeth.1931 (opens in a new tab)

  20. 20.

    Zhang Q.C., Petrey D., Garzon J.I., Deng L., Honig B. PrePPI: a structure-informed database of protein-protein interactions. Nucleic Acids Res.2013; 41:D828–D833.

    Not in our library10.1093/nar/gks1231 (opens in a new tab)

  21. 21.

    McDowall M.D., Scott M.S., Barton G.J. PIPs: human protein-protein interaction prediction database. Nucleic Acids Res.2009; 37:D651–D656.

    Not in our library10.1093/nar/gkn870 (opens in a new tab)

  22. 22.
    GeneMANIA update 2018 · 2018
    No notice
  23. 23.

    Ogris C., Guala D., Sonnhammer E.L.L. FunCoup 4: new species, data, and visualization. Nucleic Acids Res.2018; 46:D601–D607.

    Not in our library10.1093/nar/gkx1138 (opens in a new tab)

  24. 24.

    Kotlyar M., Pastrello C., Sheahan N., Jurisica I. Integrated interactions database: tissue-specific view of the human and model organism interactomes. Nucleic Acids Res.2016; 44:D536–D541.

    Not in our library10.1093/nar/gkv1115 (opens in a new tab)

  25. 25.

    Herwig R., Hardt C., Lienhard M., Kamburov A. Analyzing and interpreting genome data at the network level with ConsensusPathDB. Nat. Protoc.2016; 11:1889–1907.

    Not in our library10.1038/nprot.2016.117 (opens in a new tab)

  26. 26.

    Wong A.K., Krishnan A., Yao V., Tadych A., Troyanskaya O.G. IMP 2.0: a multi-species functional genomics portal for integration, visualization and prediction of protein functions and networks. Nucleic Acids Res.2015; 43:W128–D133.

    Not in our library10.1093/nar/gkv486 (opens in a new tab)

  27. 27.

    Lee I., Blom U.M., Wang P.I., Shim J.E., Marcotte E.M. Prioritizing candidate disease genes by network-based boosting of genome-wide association data. Genome Res.2011; 21:1109–1121.

    Not in our library10.1101/gr.118992.110 (opens in a new tab)

  28. 28.

    Snel B., Lehmann G., Bork P., Huynen M.A. STRING: a web-server to retrieve and display the repeatedly occurring neighbourhood of a gene. Nucleic Acids Res.2000; 28:3442–3444.

    Not in our library10.1093/nar/28.18.3442 (opens in a new tab)

  29. 29.

    Franceschini A., Szklarczyk D., Frankild S., Kuhn M., Simonovic M., Roth A., Lin J., Minguez P., Bork P., von Mering C. STRING v9.1: protein-protein interaction networks, with increased coverage and integration. Nucleic Acids Res.2013; 41:D808–D815.

    Not in our library10.1093/nar/gks1094 (opens in a new tab)

  30. 30.
  31. 31.

    Szklarczyk D., Morris J.H., Cook H., Kuhn M., Wyder S., Simonovic M., Santos A., Doncheva N.T., Roth A., Bork P. The STRING database in 2017: quality-controlled protein-protein association networks, made broadly accessible. Nucleic Acids Res.2017; 45:D362–D368.

    Not in our library10.1093/nar/gkw937 (opens in a new tab)

  32. 32.
  33. 33.
  34. 34.

    Wang M., Herrmann C.J., Simonovic M., Szklarczyk D., von Mering C. Version 4.0 of PaxDb: Protein abundance data, integrated across model organisms, tissues, and cell-lines. Proteomics. 2015; 15:3163–3168.

    Not in our library10.1002/pmic.201400441 (opens in a new tab)

  35. 35.
  36. 36.
  37. 37.
  38. 38.

    Enright A.J., Ouzounis C.A. Functional associations of proteins in entire genomes by means of exhaustive detection of gene fusions. Genome Biol.2001; 2:RESEARCH0034.

    Not in our library10.1186/gb-2001-2-9-research0034 (opens in a new tab)

  39. 39.

    Snel B., Bork P., Huynen M.A. The identification of functional modules from the genomic association of genes. PNAS. 2002; 99:5890–5895.

    Not in our library10.1073/pnas.092632599 (opens in a new tab)

  40. 40.

    Studham M.E., Tjarnberg A., Nordling T.E., Nelander S., Sonnhammer E.L. Functional association networks as priors for gene regulatory network inference. Bioinformatics. 2014; 30:i130–i138.

    Not in our library10.1093/bioinformatics/btu285 (opens in a new tab)

  41. 41.

    Kanehisa M., Furumichi M., Tanabe M., Sato Y., Morishima K. KEGG: new perspectives on genomes, pathways, diseases and drugs. Nucleic Acids Res.2017; 45:D353–D361.

    Not in our library10.1093/nar/gkw1092 (opens in a new tab)

  42. 42.

    Walhout A.J., Sordella R., Lu X., Hartley J.L., Temple G.F., Brasch M.A., Thierry-Mieg N., Vidal M. Protein interaction mapping in C. elegans using proteins involved in vulval development. Science. 2000; 287:116–122.

    Not in our library10.1126/science.287.5450.116 (opens in a new tab)

  43. 43.

    Yu H., Luscombe N.M., Lu H.X., Zhu X., Xia Y., Han J.D., Bertin N., Chung S., Vidal M., Gerstein M. Annotation transfer between genomes: protein-protein interologs and protein-DNA regulogs. Genome Res.2004; 14:1107–1118.

    Not in our library10.1101/gr.1774904 (opens in a new tab)

  44. 44.

    Huynen M., Snel B., Lathe W. 3rd, Bork P. Predicting protein function by genomic context: quantitative evaluation and qualitative inferences. Genome Res.2000; 10:1204–1210.

    Not in our library10.1101/gr.10.8.1204 (opens in a new tab)

  45. 45.

    Skrabanek L., Saini H.K., Bader G.D., Enright A.J. Computational prediction of protein-protein interactions. Mol. Biotechnol.2008; 38:1–17.

    Not in our library10.1007/s12033-007-0069-2 (opens in a new tab)

  46. 46.

    Barrett T., Wilhite S.E., Ledoux P., Evangelista C., Kim I.F., Tomashevsky M., Marshall K.A., Phillippy K.H., Sherman P.M., Holko M. NCBI GEO: archive for functional genomics data sets–update. Nucleic Acids Res.2013; 41:D991–D995.

    Not in our library10.1093/nar/gks1193 (opens in a new tab)

  47. 47.
  48. 48.
  49. 49.

    Buttrey S.L., Whitaker L.R. treeClust: an R package for Tree-Based clustering dissimilarities. TheR Journal. 2015; 7:227–236.

    Not in our library

  50. 50.
  51. 51.
  52. 52.

    The Gene Ontology, C Expansion of the Gene Ontology knowledgebase and resources. Nucleic Acids Res.2017; 45:D331–D338.

    Not in our library10.1093/nar/gkw1108 (opens in a new tab)

  53. 53.
  54. 54.
  55. 55.
  56. 56.

    Yu C., Woo H.J., Yu X., Oyama T., Wallqvist A., Reifman J. A strategy for evaluating pathway analysis methods. BMC Bioinformatics. 2017; 18:453.

    Not in our library10.1186/s12859-017-1866-7 (opens in a new tab)

  57. 57.

    Benyamini Y., Hochberg Y. Controlling the false discovery rate: a practical and powerful approach to multiple testing. J. R. Stat. Soc. B. 1995; 57:289–300.

    Not in our library

  58. 58.

    Cao M., Zhang H., Park J., Daniels N.M., Crovella M.E., Cowen L.J., Hescott B. Going the distance for protein function prediction: a new distance metric for protein interaction networks. PLoS One. 2013; 8:e76339.

    Not in our library10.1371/journal.pone.0076339 (opens in a new tab)

  59. 59.

    Cao M., Pietras C.M., Feng X., Doroschak K.J., Schaffner T., Park J., Zhang H., Cowen L.J., Hescott B.J. New directions for diffusion-based network prediction of protein function: incorporating pathways with confidence. Bioinformatics. 2014; 30:i219–i227.

    Not in our library10.1093/bioinformatics/btu263 (opens in a new tab)

  60. 60.

    Matias Rodrigues J.F., von Mering C. HPC-CLUST: distributed hierarchical clustering for large sets of nucleotide sequences. Bioinformatics. 2014; 30:287–288.

    Not in our library10.1093/bioinformatics/btt657 (opens in a new tab)

  61. 61.

    van der Maaten L.J.P., Hinton G.E. Visualizing data using t-SNE. J. Mach. Learn. Res.2008; 9:2579–2605.

    Not in our library

  62. 62.

Cited by papers we hold 222

and 202 more

Questions about this paper

We email you if it is retracted, withdrawn, corrected or flagged.

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.