{'fraction_non_alphanumeric': 0.02009273570324575, 'fraction_numerical': 0.0, 'mean_word_length': 5.352941176470588, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
How well are known protein complexes supported in PPI networks?

Protein complexes are groups of two or more associated proteins which are in a stable long-term interaction. This paper examine how well protein complexes are supported in protein-protein interaction (PPI) networks, i.e. whether they form connected subnetworks in a particular PPI network. For that purpose, we apply a variable neighborhood search metaheuristic algorithm for adding the minimum number of interactions in order to support each protein complex. Obtained experimental results can be useful for further biological interpretation and developing of PPI prediction models.