In this work, we have extended the experimental analysis about an encoding approach for evolutionary-based algorithms proposed in [1], called probabilistic encoding. The potential of this encoding for complex problems is huge, as candidate solutions represent regions, instead of points, of the search space. We have tested in the context of gene expression biclustering problem, in a selection of a well-known expression matrix datasets. The results obtained for the experimental analysis reveals a satisfactory performance in comparison with other evolutionary-based algorithms, and a high exploration power in very large search spaces.