A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Recognizing complicated biclusters submerged in large scale datasets (matrix) has been being a highly challenging problem. We introduce a biclustering algorithm BicGO consisting of two separate strategies which can be selectively used by users. The BicGO which was developed based on global optimization can be implemented by iteratively answering if a real number belongs to a given interval. Tested on various simulated datasets in which most complicated and most general trend-preserveddoi:10.1101/406769 fatcat:serydxns5bbhnnse6hvind2umu