BioMed Research International

BioMed Research International / 2015 / Article

Research Article | Open Access

Volume 2015 |Article ID 165186 | 7 pages |

Protein Complex Discovery by Interaction Filtering from Protein Interaction Networks Using Mutual Rank Coexpression and Sequence Similarity

Academic Editor: Zhirong Sun
Received19 Aug 2014
Revised19 Nov 2014
Accepted01 Dec 2014
Published27 Jan 2015


The evaluation of the biological networks is considered the essential key to understanding the complex biological systems. Meanwhile, the graph clustering algorithms are mostly used in the protein-protein interaction (PPI) network analysis. The complexes introduced by the clustering algorithms include noise proteins. The error rate of the noise proteins in the PPI network researches is about 40–90%. However, only 30–40% of the existing interactions in the PPI databases depend on the specific biological function. It is essential to eliminate the noise proteins and the interactions from the complexes created via clustering methods. We have introduced new methods of weighting interactions in protein clusters and the splicing of noise interactions and proteins-based interactions on their weights. The coexpression and the sequence similarity of each pair of proteins are considered the edge weight of the proteins in the network. The results showed that the edge filtering based on the amount of coexpression acts similar to the node filtering via graph-based characteristics. Regarding the removal of the noise edges, the edge filtering has a significant advantage over the graph-based method. The edge filtering based on the amount of sequence similarity has the ability to remove the noise proteins and the noise interactions.

1. Introduction

Nowadays, the cellular biology researches have shifted from molecular to modular researches and the single gene or protein study is replaced with the gene or protein networks researches. The protein complexes are responsible for many vital processes within a cell. Proper identification of the protein complexes and modules is an essential step in the identification of the cell molecular and functional mechanisms. The analysis of the interactional network of the proteins (PPI), via clustering of proteins network, is one of the ways to understand the protein complexes. The graph clustering algorithms have several applications in the network analysis. The Markov Clustering algorithm (MCL), as one of the important clustering algorithms, was applied in some investigations to identify modules in the protein interactional networks. The MCL algorithm produces some noise clusters (clusters with no known complexes) or clusters with noise proteins that reduce the accurate predictions of the complexes. The quality of the protein interactional networks to some extent depends on the preparation method. For example, the results of the Y2H and the Mas are not completely overlapping. The error rate in the protein interactions obtained from the conventional methods, such as protein chips, the immunoprecipitation, and the two-hybrid system, is estimated to be about 40–90% [1]. Moreover, just 30–40% of the existing interactions in databases are related to the specific biological function [2]. In other words, most of the existing interactions lack a specific performance.

Protein data networks are static, whereas the functional module expresses a dynamic concept. Thus, the composition and the kind of proteins in a protein complex depend on the cell survival stage, the cell interaction, and the environment condition [3]. In other words, the interactions of the pair proteins in the interaction networks are not permanent. Despite this issue, these kinds of interactions have been applied in the PPI networks during the network clustering. Therefore, several interactions are stationed in the implemented clusters as noise. In this case, removing and modifying the clusters seem necessary.

Noise interactions could be eliminated from protein clusters by weighting interactions according to their differentiated weight. Various methods have been used to weight the interactions. Brun et al. used the graph characteristics for weighting the graph edges [4]. Lubovac et al. used the similarity scale of the GO between each pair of proteins for weighting the interactions [5]. Kritikos et al. weighted each interaction according to the way it was obtained [3]. Researchers showed that there is a significant relationship between the sequence similarity rate of each protein-pair and its rate of functional similarity in the protein-pairs of the protein interaction network [6, 7]. Joshi and Xu showed that, in protein-pairs with sequence identity equal to 30% or less, the possibility of observing the similar GO terms decreases [8]. Laboratory study results have shown that the amino acid sequence data of the proteins have sufficient capacity to predict the protein interactions [914]. In several studies, two criteria, identity and similarity, were used to study the protein sequences. Although the high identity rate between the two sequences represents their function similarity, the conclusion of the proteins’ function similarity based on the identity rate of the sequence is usually inconclusive and baseless since the two sequence identities are usually very low [8]. In this research, we have introduced two new methods for weighting interactions in protein clusters to edit interactions and noise proteins.

2. Methods

2.1. Database and Clustering Method

The protein interaction network of Human Protein Reference Database (HPRD) [15] was used as the protein-protein interaction database. The Markov Clustering algorithm [16] was used to cluster the protein interaction network “HPRD” and to identify the protein clusters. Taking into consideration that Gavin et al. showed that the number of proteins in each module is between 5 and 10 [17], we have compared the clusters generated by the default values (inflation: 1.6, 1.8, 2, and 2.2) with the known protein complexes of the HPRD database to obtain the suitable influence parameters for the MCL algorithm. Given the number of clusters containing 5 to 10 proteins generated by the default inflation parameters (1.8, 2, and 2.2), no significant differences were observed between these clusters (of 5 to 10 proteins) in terms of the mentioned parameters. So, the value of 1.8 for the inflation parameter was considered.

2.2. Filtering Method
2.2.1. Node Filtering

The selected clusters were compared with each other, using the two node filtering and edge filtering methods. For the node filtering method, the MCL-CA algorithm [18] was used. The MCL-CA algorithm identified the core and the attachment proteins in protein complexes based on the graph based characteristics of the protein network. In each cluster, the proteins, which have a higher edge degree than the average degree of the cluster edges, were selected as core proteins. Therefore, in the node filtering method, the proteins, in which their edge degree is less than the average degree of their cluster, were removed.

2.2.2. Edge Filtering

(1) Filtering Based on Coexpression. The coexpression level of each pair of genes is considered the edge weight of the corresponding proteins with two genes in the PPI network. Pearson’s correlation coefficient (PCC) is usually used to represent the coexpression of genes. Another indicator, which is used to present the coexpression of the two genes, is the rank index of the two genes towards each other. Since the rank of gene “A” to gene “C” () is not necessarily equal to the rank gene, and due to the weakness of the Pearson correlation coefficient (PCC) in identifying and predicting the gene performance, as well as the GO interpretation [19], the geometric mean of the rank of the two coexpressed genes in regard to each other—“Mutual Rank” (MR)—was used to display the amount of the coexpression level of both genes (Table 1).

Genes A → C Rank 3Genes C → A Rank 4

11Gene A11Gene C
20.96Gene B20.99Gene D
30.95Gene C30.97Gene B
40.92Gene D40.95Gene A
50.87Gene E50.90Gene G


When the numerical amount of the MR is small, it indicates the strength of the coexpression of the two genes [20]. For each interacting protein-pair from HPRD, the MR was calculated, using the COXPRESdb database [20].

In the edge filtering method, based on coexpression, removing of the edge was performed based on the filtering of the edge containing the weak MR. The first neighbouring protein in the PPI network was identified and added to the proteins of each cluster to identify the threshold level of removing the edges.

Then, the characteristics, such as the average node degree (average node degree = ), the edge density (edge density = (), (the number of edges: , and the number of nodes: ), the average coexpression, and the functional score—in the clusters before and after the addition of neighbouring proteins—were compared with one another. The functional score was calculated by the “GraphWeb” web server, using the g:Profiler data [21, 22]. Once a cluster has been identified by the MCL algorithm, the GraphWeb automatically assesses its biological importance through the known properties of its members, using the g:Profiler software. Functional profiling of the cluster involves the statistically enriched annotations of biological processes, the cellular component, molecular functions, and related pathways.

The data used in the g:Profiler is derived from the Gene Ontology [23] and the pathways from the Kyoto Encyclopedia of Genes and Genomes (KEGG) [24] and Reactome [25] databases. The g:Profiler uses cumulative hypergeometric values to identify the most significant terms corresponding to the input set of the genes, and it applies Fisher’s test to evaluate the enrichments of all the biological annotations in the cluster. Once all the enrichments for the cluster are known, the “GraphWeb” computes an annotation score that sums the total significance relative to the cluster size . The score is calculated by summing the logarithms of all the significant values.

(2) Filtering Based on Sequence Similarity Rate. In each cluster, the protein-pairs with interactions were aligned together, and the similarity rate of each pair of proteins was considered the edge weight between the two proteins in the network. Then, the edges weighting less than 30 were excluded in each cluster. The BALIGN software, in the form of a Matlab program, was used to calculate the sequence similarity rate of protein-pairs with interactions [26]. BALIGN can be used to compute the pairwise alignments for the given lists of sequences. It can perform with both global [27] and local alignments [28] with affine gap penalties; and it can produce the Bit-score, the conservation score, and the percent identity matrices. We have calculated the similarity score for a pair of proteins, using the local alignment, and we will use the BLOSUM62 score matrix.

There is a direct relationship between similarity and Bit-scores; that is, the greater the similarity between the two proteins, the higher the Bit-score; also the function similarity between the two proteins generally increases as their sequence similarity increases over a broad range of Bit-scores [7, 29]. We applied a Bit-Score threshold of 30 for the edge filtering and, then, the edges weighing less than 30 were excluded in each cluster.

Properties, such as the number of nodes (proteins), the number of edges (interaction), and the functional score, have been measured before and after filtering, using the above two methods in each cluster. Then, the proteins were compared with the protein complexes and dense modules of the CORUM database [30] before and after filtering of each cluster; then, the numbers of the shared proteins with the known protein complex were calculated. In each cluster, properties, such as the number of nodes, the number of edges, and the functional score, were compared by the paired -test procedure (Formula (1)) before and after filtering: Formula (1) is the paired -test formula, where is the sum of the differences (i.e., the sum of ) and is the sum of the squared differences.

To determine whether the protein is properly removed from the cluster by the filtering method is a binary classification problem. Table 2 lists five measurements that are applied widely on evaluating binary classification problems. The accuracy is the most commonly used measurement.


SensitivitySens.TP/(TP + FN)
SpecificitySpec.TN/(TN + FP)
PrecisionPrec.TP/(TP + FP)
-measureFm.(2 Prec. Sens.)/(Prec. + Sens.)
AccuracyAcc.(TP + FN)/(TP + TN + FP + FN)

TP: true positives, FP: false positives, TN: true negatives, and FN: false negatives. TP: the number of known proteins (CORUM protein complex) that have not been properly removed by the filtering method. FN: the number of known proteins that have erroneously been deleted by the filtering method. FP: the number of unknown proteins that are not removed by the filtering method. TN: the number of unknown proteins that are removed by the filtering method.

Statistical analysis was performed, using the SPSS software. The steps of the materials and the methods are summarized in Figure 1.

3. Results and Discussion

From 1966 clusters produced by the clustering network (HPRD), 565 clusters had 5 to 35 proteins. While these 565 clusters were compared with the known protein complexes clusters of the HPRD database, 235 clusters with protein complexes were selected and analyzed.

Comparing these clusters before and after the addition of neighbouring nodes indicated that, by adding the neighbouring nodes, the mean value of the MR increased between an average of 800 and 1600 units per cluster. On the contrary, the amount of the functional score decreased between 16 and 40 points. This means that the added edges to each cluster had a high MR value.

According to the negative correlation between the MR value of the edge density and functional score (Figures 2 and 3), the value of MR = 1000 was considered as the threshold level of the weak coexpression between the two genes. Therefore, the edges of each protein-pair in a cluster with the value of coexpression greater than MR = 1000 were removed. This was approved by Obayashi and Kinoshita [20] in a research that considered the coexpression with MR > 1000 as weak and unreliable.

The statistical analysis of the node filtering method (based on the graph characteristics) and the edge filtering method (based on the gene expression) showed that both filtering methods significantly reduced the number of nodes, in terms of “the number of nodes per cluster” (Figure 4). The -test results showed that there was a reduction of 4 to 8 nodes in 95 percent of the clusters, but there was no significant difference between the two approaches in the number of filtered nodes. In other words, the results of the filtering technique with both node and edge removing methods were identical in terms of the number of removed nodes.

Although the -test results showed that there was no difference between these filtering methods in terms of the number of removed proteins, the comparison of the “sensitivity” in the two methods (Table 3) showed that the filtering based on the MR (sensitivity: 82%) had a higher capability of not removing the known protein complexes (TP) than that of the method based on the graph (sensitivity: 73%). On the other hand, the higher amount of the “specificity” based on the graph method (specificity: 70%) showed the capability of this method to remove other noncomplex proteins (TN).

Filtering methodSensitivity (%)Specificity (%)Precision (%)-measure (%)Accuracy (%)

Based on MR 82%62%68%74%72%
Based on similarity94%30%57%70%78%
Based on graph73%70%71%71%67%

The statistical analysis of the node filtering method (based on the graph characteristics) and the edge filtering method (based on the sequence similarity) showed that both filtering methods significantly reduced the number of nodes in terms of “the number of nodes per cluster” (Figure 4). However, the results showed that the number of eliminated nodes was greater in filtering by the node elimination method compared with filtering by the edge removal method, but in the method based on the similarity, the amount of sensitivity (94%) showed the higher capability of this method to not eliminate the known complex proteins. On the other hand, the capability of this method to eliminate the noncomplex proteins (TN) is low (specificity: 30%). The higher accuracy of both methods of the edge elimination, in comparison with the node elimination, shows the capacity of these methods in filtering the protein clusters and recognizing the protein complexes.

The statistical analysis of the effect of the three filtering methods on “the number of removed edges” indicates that the filtering methods significantly decreased the number of edges in clusters (Figure 4), but the edge reduction, using a coexpression factor, is more effective than that of the graph based approach; therefore, 95% of the clusters showed a decrease of 13 to 22 edges. However, in the node elimination method, the average number of edges removed was between 8 and 15, and the edge reduction, using the sequence similarity, showed a decrease of 6 to 12 edges in each cluster. In other words, there was a significant difference between the coexpression method and other filtering methods in terms of the reduction of the number of edges.

The statistical analysis of the three filtering methods on the “functional score” of clusters indicated that, in the filtering methods, there was no significant statistical difference between the filtered clusters and clusters with no filtering (Figure 4). This means that proteins and interactions that are eliminated from the primary clusters were without any significant performance associated with other cluster proteins. In other words, these proteins have no definite function in terms of GO, Reactome, and KEEG information or their performance is not similar to the remaining proteins.

The statistical comparison of the filtered clusters with the three methods of filtering, in terms of “the number of common proteins” of each cluster with the known proteins in protein complexes databases CORUM, showed that, in the methods of filtering, the ratio of the known proteins in the CORUM database to the protein number in each cluster has been improved in comparison with the nonfiltering methods, but there were no significant differences between the filtering methods. In other words, in the filtering methods, the removed proteins from the clusters were not included in the complex proteins (Figure 5).

For example, in cluster 92, the number of cluster edges decreased from 33 to 15 due to the edge filtering based on the MR and it decreased from 33 to 19 due to the edge filtering based on the sequence similarity. These decreases in the number of the edges caused the removal of 6 proteins in the MR base and 5 proteins in the sequence similarity base, while, in the node elimination method, 7 proteins, one of which (EXOSC3) belonging to the known proteins of the corum_788 complex, were removed (Figure 6).

4. Conclusion

The filtering method, using the coexpression index of the MR, has advantages compared to the node elimination method. The filtering technique based on the MR is more efficient than the graph based method in removing noise edges. This advantage becomes more important when we know that a large percentage (40% to 90%) of the existing interactions in the protein interaction network are noise. Although this method eliminated approximately 65% of the protein clusters’ edge, no reduction in the number of known protein complexes and functional scores was observed.

The filtering method (using the sequence similarity index) has a biological basis, which is based on the principle that “the proteins amino acid sequence data indicate the structure, function, and interactions of the proteins.” Meanwhile, the node removal procedure is based solely on the topological properties of the PPI network graph.

On the other hand, the MCL-CA algorithm considers all the clusters, resulting from clustering, as potentially containing protein complexes, while regarding this default, filters cluster to identify the complexes. In each cluster, proteins with dense communications are considered as the core and proteins containing less communication are removed as noises. Based on the clusters from the network clustering in the CORUM database, it is concluded that any dense complex cannot necessarily be considered as a protein complex with a specific biological function. In each cluster, the presence of a core set as the default of the MCL_CA algorithm causes the algorithm to search all the clusters, created by the MCL, for core proteins.

However, using the filtering methods based on the MR, the clusters in which the amount of coexpression is at a high level (MR > 1000) and does not have any protein-pairs with MR < 1000 are eliminated as noise clusters at the start.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.


  1. X. Wang, J. Yue, X. Ren et al., “Modularity analysis based on predicted protein-protein interactions provides new insights into pathogenicity and cellular process of Escherichia coli O157:H7,” Theoretical Biology and Medical Modelling, vol. 8, no. 1, article 47, 2011. View at: Publisher Site | Google Scholar
  2. L. Shi, Y.-R. Cho, and A. Zhang, “Prediction of protein function from connectivity of protein interaction networks,” International Journal of Computational Bioscience, vol. 1, 2010. View at: Publisher Site | Google Scholar
  3. G. D. Kritikos, C. Moschopoulos, M. Vazirgiannis, and S. Kossida, “Noise reduction in protein-protein interaction graphs by the implementation of a novel weighting scheme,” BMC Bioinformatics, vol. 12, article 239, 2011. View at: Publisher Site | Google Scholar
  4. C. Brun, F. Chevenet, D. Martin, J. Wojcik, A. Guénoche, and B. Jacq, “Functional classification of proteins for the prediction of cellular function from a protein-protein interaction network,” Genome Biology, vol. 5, article R6, 2003. View at: Publisher Site | Google Scholar
  5. Z. Lubovac, J. Gamalielsson, and B. Olsson, “Combining functional and topological properties to identify core modules in protein interaction networks,” Proteins: Structure, Function and Genetics, vol. 64, no. 4, pp. 948–959, 2006. View at: Publisher Site | Google Scholar
  6. P. W. Lord, R. D. Stevens, A. Brass, and C. A. Goble, “Investigating semantic similarity measures across the gene ontology: the relationship between sequence and annotation,” Bioinformatics, vol. 19, no. 10, pp. 1275–1283, 2003. View at: Publisher Site | Google Scholar
  7. J. Wang, X. Zhou, J. Zhu, C. Zhou, and Z. Guo, “Revealing and avoiding bias in semantic similarity scores for protein pairs,” BMC Bioinformatics, vol. 11, article 290, 2010. View at: Publisher Site | Google Scholar
  8. T. Joshi and D. Xu, “Quantitative assessment of relationship between sequence similarity and function similarity,” BMC Genomics, vol. 8, article 222, 2007. View at: Publisher Site | Google Scholar
  9. Z.-H. You, Y.-K. Lei, L. Zhu, J. Xia, and B. Wang, “Prediction of protein-protein interactions from amino acid sequences with ensemble extreme learning machines and principal component analysis,” BMC Bioinformatics, vol. 14, no. 8, article S10, 2013. View at: Publisher Site | Google Scholar
  10. Y.-K. Lei, Z.-H. You, Z. Ji, L. Zhu, and D.-S. Huang, “Assessing and predicting protein interactions by combining manifold embedding with multiple information integration,” BMC Bioinformatics, vol. 13, supplement 7, article S3, 2012. View at: Publisher Site | Google Scholar
  11. Z.-H. You, Y.-K. Lei, J. Gui, D.-S. Huang, and X. Zhou, “Using manifold embedding for assessing and predicting protein interactions from high-throughput experimental data,” Bioinformatics, vol. 26, no. 21, pp. 2744–2751, 2010. View at: Publisher Site | Google Scholar
  12. J.-F. Xia, K. Han, and D.-S. Huang, “Sequence-based prediction of protein-protein interactions by means of rotation forest and autocorrelation descriptor,” Protein and Peptide Letters, vol. 17, no. 1, pp. 137–145, 2010. View at: Publisher Site | Google Scholar
  13. J.-F. Xia, X.-M. Zhao, and D.-S. Huang, “Predicting protein-protein interactions from protein sequences using meta predictor,” Amino Acids, vol. 39, no. 5, pp. 1595–1599, 2010. View at: Publisher Site | Google Scholar
  14. J. Shen, J. Zhang, X. Luo et al., “Predicting protein-protein interactions based only on sequences information,” Proceedings of the National Academy of Sciences of the United States of America, vol. 104, no. 11, pp. 4337–4341, 2007. View at: Publisher Site | Google Scholar
  15. S. Peri, J. D. Navarro, R. Amanchy et al., “Development of human protein reference database as an initial platform for approaching systems biology in humans,” Genome Research, vol. 13, no. 10, pp. 2363–2371, 2003. View at: Publisher Site | Google Scholar
  16. S. Van Dongen, MCL—graph clustering by flow simulation [Ph.D. thesis], University of Utrecht, 2000.
  17. A.-C. Gavin, P. Aloy, P. Grandi et al., “Proteome survey reveals modularity of the yeast cell machinery,” Nature, vol. 440, no. 7084, pp. 631–636, 2006. View at: Publisher Site | Google Scholar
  18. S. Srihari, K. Ning, and H. W. Leong, “Refining Markov Clustering for protein complex prediction by incorporating core-attachment structure.,” Genome informatics. International Conference on Genome Informatics, vol. 23, no. 1, pp. 159–168, 2009. View at: Google Scholar
  19. T. Obayashi and K. Kinoshita, “Rank of correlation coefficient as a comparable measure for biological significance of gene coexpression,” DNA Research, vol. 16, no. 5, pp. 249–260, 2009. View at: Publisher Site | Google Scholar
  20. T. Obayashi and K. Kinoshita, “COXPRESdb: a database to compare gene coexpression in seven model animals,” Nucleic Acids Research, vol. 39, no. 1, pp. D1016–D1022, 2011. View at: Publisher Site | Google Scholar
  21. J. Reimand, T. Arak, and J. Vilo, “G:Profiler—a web server for functional interpretation of gene lists (2011 update),” Nucleic Acids Research, vol. 39, no. 2, pp. W307–W315, 2011. View at: Publisher Site | Google Scholar
  22. J. Reimand, L. Tooming, H. Peterson, P. Adler, and J. Vilo, “GraphWeb: mining heterogeneous biological networks for gene modules with functional significance,” Nucleic Acids Research, vol. 36, supplement 2, pp. W452–W459, 2008. View at: Publisher Site | Google Scholar
  23. M. Ashburner, C. A. Ball, J. A. Blake et al., “Gene ontology: tool for the unification of biology,” Nature Genetics, vol. 25, no. 1, pp. 25–29, 2000. View at: Publisher Site | Google Scholar
  24. M. Kanehisa, S. Goto, M. Hattori et al., “From genomics to chemical genomics: new developments in KEGG,” Nucleic Acids Research, vol. 34, pp. D354–D357, 2006. View at: Publisher Site | Google Scholar
  25. G. Joshi-Tope, M. Gillespie, I. Vastrik et al., “Reactome: a knowledgebase of biological pathways,” Nucleic Acids Research, vol. 33, pp. D428–D432, 2005. View at: Publisher Site | Google Scholar
  26. E. Aygün, B. J. Oommen, and Z. Cataltepe, “Peptide classification using optimal and information theoretic syntactic modeling,” Pattern Recognition, vol. 43, no. 11, pp. 3891–3899, 2010. View at: Publisher Site | Google Scholar
  27. S. B. Needleman and C. D. Wunsch, “A general method applicable to the search for similarities in the amino acid sequence of two proteins,” Journal of Molecular Biology, vol. 48, no. 3, pp. 443–453, 1970. View at: Publisher Site | Google Scholar
  28. T. F. Smith and M. S. Waterman, “Identification of common molecular subsequences,” Journal of Molecular Biology, vol. 147, no. 1, pp. 195–197, 1981. View at: Publisher Site | Google Scholar
  29. B. Louie, R. Higdon, and E. Kolker, “A statistical model of protein sequence similarity and function similarity reveals overly-specific function predictions,” PLoS ONE, vol. 4, no. 10, Article ID e7546, 2009. View at: Publisher Site | Google Scholar
  30. A. Ruepp, B. Brauner, I. Dunger-Kaltenbach et al., “CORUM: the comprehensive resource of mammalian protein complexes,” Nucleic Acids Research, vol. 36, no. 1, pp. D646–D650, 2008. View at: Publisher Site | Google Scholar
  31. P. Shannon, A. Markiel, O. Ozier et al., “Cytoscape: a software environment for integrated models of biomolecular interaction networks,” Genome Research, vol. 13, no. 11, pp. 2498–2504, 2003. View at: Publisher Site | Google Scholar

Copyright © 2015 Ali Kazemi-Pour et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

752 Views | 345 Downloads | 1 Citation
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19.