{'fraction_non_alphanumeric': 0.01794453507340946, 'fraction_numerical': 0.0, 'mean_word_length': 5.596774193548387, '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}}
Identifying protein complexes based on neighborhood density in weighted PPI networks

Most proteins form macromolecular complexes to perform their biological functions. With the increasing availability of large amounts of high-throughput protein-protein interaction (PPI) data, a vast number of computational approaches for detecting protein complexes have been proposed to discover protein complexes from PPI networks. However, such approaches are not good enough since the high rate of noise in high-throughput PPI data, including spurious and missing interactions. In this paper, we present an algorithm for complexes identification based on neighborhood density (CIND) in weighted PPI networks. Firstly, we assigned each binary protein interaction a weight, reflecting the confidence that this interaction is a true positive interaction. Then we identify complexes based on neighborhood density using topological, and we should put attention to not only the very dense regions but also the regions with low neighborhood density. We experimentally evaluate the performance of our algorithm CIND on a few yeast PPI networks, and show that our algorithm is able to identify complexes more accurately than existing algorithms.