Discovering motifs in ranked lists of DNA sequences

被引:512
|
作者
Eden, Eran [1 ]
Lipson, Doron
Yogev, Sivan
Yakhini, Zohar
机构
[1] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[2] IBM Res Labs, Haifa, Israel
[3] Agilent Labs, Santa Clara, CA USA
关键词
D O I
10.1371/journal.pcbi.0030039
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Computational methods for discovery of sequence elements that are enriched in a target set compared with a background set are fundamental in molecular biology research. One example is the discovery of transcription factor binding motifs that are inferred from ChIP-chip (chromatin immuno-precipitation on a microarray) measurements. Several major challenges in sequence motif discovery still require consideration: (i) the need for a principled approach to partitioning the data into target and background sets; (ii) the lack of rigorous models and of an exact p-value for measuring motif enrichment; (iii) the need for an appropriate framework for accounting for motif multiplicity; (iv) the tendency, in many of the existing methods, to report presumably significant motifs even when applied to randomly generated data. In this paper we present a statistical framework for discovering enriched sequence elements in ranked lists that resolves these four issues. We demonstrate the implementation of this framework in a software application, termed DRIM (discovery of rank imbalanced motifs), which identifies sequence motifs in lists of ranked DNA sequences. We applied DRIM to ChIP-chip and CpG methylation data and obtained the following results. (i) Identification of 50 novel putative transcription factor (TF) binding sites in yeast ChIP-chip data. The biological function of some of them was further investigated to gain new insights on transcription regulation networks in yeast. For example, our discoveries enable the elucidation of the network of the TF ARO80. Another finding concerns a systematic TF binding enhancement to sequences containing CA repeats. (ii) Discovery of novel motifs in human cancer CpG methylation data. Remarkably, most of these motifs are similar to DNA sequence elements bound by the Polycomb complex that promotes histone methylation. Our findings thus support a model in which histone methylation and CpG methylation are mechanistically linked. Overall, we demonstrate that the statistical framework embodied in the DRIM software tool is highly effective for identifying regulatory sequence elements in a variety of applications ranging from expression and ChIP-chip to CpG methylation data. DRIM is publicly available at http:// bioinfo.cs.technion.ac.il/drim.
引用
收藏
页码:508 / 522
页数:15
相关论文
共 50 条
  • [1] Discovering motifs in DNA sequences
    Guan, JW
    Liu, DY
    Bell, DA
    FUNDAMENTA INFORMATICAE, 2004, 59 (2-3) : 119 - 134
  • [2] Discovering Motifs in DNA Sequences: A Candidate Motifs Based Approach
    Jain, Abhinav
    Parashar, Rajat
    Goyal, Ashish Kumar
    Biswas, Prantik
    Dawn, Suma
    Nanda, Aparajita
    2018 FIFTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND GRID COMPUTING (IEEE PDGC), 2018, : 599 - 604
  • [3] Discovering Motifs in DNA Sequences: A Suffix Tree Based Approach
    Prakash, Sanchi
    Agarwal, Harshit
    Agarwal, Urvi
    Biswas, Prantik
    Dawn, Suma
    PROCEEDINGS OF THE 2018 IEEE 8TH INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC 2018), 2018, : 327 - 332
  • [4] EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
    Hu, Jianjun
    Yang, Yifeng D.
    Kihara, Daisuke
    BMC BIOINFORMATICS, 2006, 7 (1)
  • [5] EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
    Jianjun Hu
    Yifeng D Yang
    Daisuke Kihara
    BMC Bioinformatics, 7
  • [6] Efficient motif search in ranked lists and applications to variable gap motifs
    Leibovich, Limor
    Yakhini, Zohar
    NUCLEIC ACIDS RESEARCH, 2012, 40 (13) : 5832 - 5847
  • [7] Parallelizing and optimizing a hybrid differential evolution with Pareto tournaments for discovering motifs in DNA sequences
    David L. González-Álvarez
    Miguel A. Vega-Rodríguez
    Álvaro Rubio-Largo
    The Journal of Supercomputing, 2014, 70 : 880 - 905
  • [8] Parallelizing and optimizing a hybrid differential evolution with Pareto tournaments for discovering motifs in DNA sequences
    Gonzalez-Alvarez, David L.
    Vega-Rodriguez, Miguel A.
    Rubio-Largo, Alvaro
    JOURNAL OF SUPERCOMPUTING, 2014, 70 (02): : 880 - 905
  • [9] Mutual enrichment in ranked lists and the statistical assessment of position weight matrix motifs
    Leibovich, Limor
    Yakhini, Zohar
    ALGORITHMS FOR MOLECULAR BIOLOGY, 2014, 9
  • [10] Mutual enrichment in ranked lists and the statistical assessment of position weight matrix motifs
    Limor Leibovich
    Zohar Yakhini
    Algorithms for Molecular Biology, 9