DNA research : an international journal for rapid publication of reports on genes and genomes
Detecting binding motifs of combinatorial transcription factors (TFs) from chromatin immunoprecipitation sequencing (ChIP-seq) experiments is an important and challenging computational problem for understanding gene regulations. Although a number of motif-finding algorithms have been presented, most are either time consuming or have sub-optimal accuracy for processing large-scale datasets. In this article, we present a fully parallelized algorithm for detecting combinatorial motifs from ChIP-seq datasets by using Fisher combined method and OpenMP parallel design. Large scale validations on both synthetic data and 350 ChIP-seq datasets from the ENCODE database showed that FisherMP has not only super speeds on large datasets, but also has high accuracy when compared with multiple popular methods. By using FisherMP, we successfully detected combinatorial motifs of CTCF, YY1, MAZ, STAT3 and USF2 in chromosome X, suggesting that they are functional co-players in gene regulation and chromosomal organization. Integrative and statistical analysis of these TF-binding peaks clearly demonstrate that they are not only highly coordinated with each other, but that they are also correlated with histone modifications. FisherMP can be applied for integrative analysis of binding motifs and for predicting cis-regulatory modules from a large number of ChIP-seq datasets.
Zhang, Shaoqiang; Liang, Ying; Wang, Xiangyun; Su, Zhengchang; and Chen, Yong, "FisherMP: fully parallel algorithm for detecting combinatorial motifs from large ChIP-seq datasets." (2019). Faculty Scholarship for the College of Science & Mathematics. 129.
Shaoqiang Zhang, Ying Liang, Xiangyun Wang, Zhengchang Su, and Yong Chen. (2019). FisherMP: Fully parallel algorithm for detecting combinatorial motifs from large ChIP-seq datasets. DNA Research, Volume 26, Issue 3, June 2019, Pages 231–24.