A Biclustering Algorithm to Discover Functional Modules from ENCODE ChIP-Seq Data

• Main Authors: Chao Wu, Bakshi, Arjun, Aronow, Bruce, Jegga, Anil, Bhatnagar, Raj
• Format: Conference Proceeding
• Language: English
• Subjects: Algorithm design and analysis; Biclustering; ChIP-seq analysis; Clustering algorithms; combinatorial regulation of TFs; Gene expression; Measurement; Sociology; Statistics
• ISSN: 2375-9232; 2375-9259
• DOI: 10.1109/ICDMW.2013.96

A number of biclustering algorithms have been introduced to discover local gene expression patterns in micro array data. Also, High-throughput biological techniques such as ChIP-seq have generated massive genome-wide data and offered ideal opportunities where biclustering can help unveil underlying biological mechanisms. Chromatin immunoprecipitation with massively parallel sequencing (ChIP-seq) has been used to identify how transcription factors (TF) and other chromatin-associated proteins influence binding mechanisms. In the data the peaks indicate binding events with possible binding locations and their strengths. It is essential that the values associated with the peaks be as close as possible to each other in the selected biclusters. Here we present a novel framework capable of finding statistically significant biclusters on this type of real-valued datasets. The ideal biclusters should contain similar values with very low variance. We applied our algorithm on ChIP-seq datasets recently released from the ENCODE project and uncovered meaningful biclusters of genes and TFs which can be interpreted as local combinatorial regulation patterns of TFs. We also compared our proposed method to several competing biclustering algorithms to show that it outperforms others in unveiling this type of patterns.