{'fraction_non_alphanumeric': 0.01602136181575434, 'fraction_numerical': 0.0033377837116154874, 'mean_word_length': 5.405982905982906, '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}}
Finding distinct biclusters from background in gene expression matrices

Biclustering, or the discovery of subsets of samples and genes that are homogeneous and distinct from the background, has become an important technique in analyzing current microarray datasets. Most existing biclustering methods define a bicluster type as a fixed (predefined) pattern and then trying to get results in some searching process. In this work, we propose a novel method for finding biclusters or 2-dimensional patterns that are significantly distinct from the background without the need for pre-defining a pattern within the bicluster. The method named Distinct 2-Dimensional Pattern Finder (D2D) is composed of an iterative reordering step of the rows and columns in the matrix using a new similarity measure, and a flexible scanning-and-growing step to identify the biclusters. Experiments on a large variety of simulation data show that the method works consistently well under different conditions, whereas the existing methods compared may work well under some certain conditions but fail under some other conditions. The impact of noise levels, overlapping degrees between clusters and different setting of parameters were also investigated, which indicated that the D2D method is robust against these factors. The proposed D2D method can efficiently discover many different types of biclusters given that they have distinctive features from the background. The computer program is available upon request.