Nucleosome Occupancy Information Improves de novo Motif Discovery

  • Leelavati Narlikar
  • Raluca Gordân
  • Alexander J. Hartemink
Conference paper

DOI: 10.1007/978-3-540-71681-5_8

Volume 4453 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Narlikar L., Gordân R., Hartemink A.J. (2007) Nucleosome Occupancy Information Improves de novo Motif Discovery. In: Speed T., Huang H. (eds) Research in Computational Molecular Biology. RECOMB 2007. Lecture Notes in Computer Science, vol 4453. Springer, Berlin, Heidelberg

Abstract

A complete understanding of transcriptional regulatory processes in the cell requires identification of transcription factor binding sites on a genome-wide scale. Unfortunately, these binding sites are typically short and degenerate, posing a significant statistical challenge: many more matches to known transcription factor binding sites occur in the genome than are actually functional. Chromatin structure is known to play an important role in guiding transcription factors to those sites that are functional. In particular, it has been shown that active regulatory regions are usually depleted of nucleosomes, thereby enabling transcription factors to bind DNA in those regions [1]. In this paper, we describe a novel algorithm which employs an informative prior over DNA sequence positions based on a discriminative view of nucleosome occupancy; the nucleosome occupancy information comes from a recently published computational model [2]. When a Gibbs sampling algorithm with our informative prior is applied to yeast sequence-sets identified by ChIP-chip [3], the correct motif is found in 50% more cases than with an uninformative uniform prior. Moreover, if nucleosome occupancy information is not available, our informative prior reduces to a new kind of prior that can exploit discriminative information in a purely generative setting.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Leelavati Narlikar
    • 1
  • Raluca Gordân
    • 1
  • Alexander J. Hartemink
    • 1
  1. 1.Department of Computer Science, Duke University, Durham, NC 27708-0129