{'fraction_non_alphanumeric': 0.014736842105263158, 'fraction_numerical': 0.0, 'mean_word_length': 5.057324840764331, '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}}
A Projection and Search Algorithm for the Bicluster Problem

The advent of microarray technologies has made the experimental study of gene expression faster and more efficient. It is an important task to analyze the gene expression data acquired from the microarray experiments. Biclustering is a popular method to search a subset of genes which exhibit similar expression patterns along a subset of conditions in the gene expression matrix. In this paper, we propose a projection and search algorithm (PSA) for finding biclusters in the gene expression matrix. The algorithm adopts projection method to find a raw submatrix, then refines and extends the raw submatrix into a bicluster using greedy algorithms. We test the algorithm on simulation data and real data. The test results show that the algorithm has good performance on both simulation data and real data. Additionally, compared with other methods, PSA isnpsilat sensitive to noise level.