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 条
  • [31] ARC to revise the ranked journal lists
    Atkinson, Roger
    McBeath, Clare
    ISSUES IN EDUCATIONAL RESEARCH, 2010, 20 (03): : I - IV
  • [32] DISCOVERING ACTIVE MOTIFS IN SETS OF RELATED PROTEIN SEQUENCES AND USING THEM FOR CLASSIFICATION
    WANG, JTL
    MARR, TG
    SHASHA, D
    SHAPIRO, BA
    CHIRN, GW
    NUCLEIC ACIDS RESEARCH, 1994, 22 (14) : 2769 - 2775
  • [33] Finding Motifs in DNA Sequences Using Low-Dispersion Sequences
    Wang, Xun
    Miao, Ying
    Cheng, Minquan
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2014, 21 (04) : 320 - 329
  • [34] Detecting Motifs in DNA Sequences by Branching from Neighbors of Qualified Potential Motifs
    Song, Tao
    Wang, Xun
    Zhang, Zhujin
    Hong, Liu
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2013, 10 (09) : 2201 - 2206
  • [35] Discovering DNA shape motifs with multiple DNA shape features: generalization, methods, and validation
    Chen, Nanjun
    Yu, Jixiang
    Liu, Zhe
    Meng, Lingkuan
    Li, Xiangtao
    Wong, Ka-Chun
    NUCLEIC ACIDS RESEARCH, 2024, 52 (08) : 4137 - 4150
  • [36] Constraint based method for finding motifs in DNA sequences
    Dong, X
    Sung, SY
    Sung, WK
    Tan, CL
    BIBE 2004: FOURTH IEEE SYMPOSIUM ON BIOINFORMATICS AND BIOENGINEERING, PROCEEDINGS, 2004, : 483 - 490
  • [37] New scoring schema for finding motifs in DNA Sequences
    Zare-Mirakabad, Fatemeh
    Ahrabian, Hayedeh
    Sadeghi, Mehdei
    Nowzari-Dalini, Abbas
    Goliaei, Bahram
    BMC BIOINFORMATICS, 2009, 10
  • [38] Discovering frequent poly-regions in DNA sequences
    Papapetrou, Panagiotis
    Benson, Gary
    Kollios, George
    ICDM 2006: SIXTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, WORKSHOPS, 2006, : 94 - 98
  • [39] Supervised detection of conserved motifs in DNA sequences with cosmo
    Bembom, Oliver
    Keles, Sunduz
    van der Laan, Mark J.
    STATISTICAL APPLICATIONS IN GENETICS AND MOLECULAR BIOLOGY, 2007, 6
  • [40] PEAKS:: identification of regulatory motifs by their position in DNA sequences
    Bellora, Nicolas
    Farre, Domenec
    Alba, M. Mar
    BIOINFORMATICS, 2007, 23 (02) : 243 - 244