By Topic

Computational Detection of Transcription Factor Binding Sites Through Differential Rényi Entropy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Maynou, J. ; Dept. ESAII, Tech. Univ. of Catalonia (UPC), Barcelona, Spain ; Gallardo-Chacon, J.-J. ; Vallverdu, M. ; Caminal, P.
more authors

Regulatory sequence detection is a critical facet for understanding the cell mechanisms in order to coordinate the response to stimuli. Protein synthesis involves the binding of a transcription factor to specific sequences in a process related to the gene expression initiation. A characteristic of this binding process is that the same factor binds with different sequences placed along all genome. Thus, any computational approach shows many difficulties related with this variability observed from the binding sequences. This paper proposes the detection of transcription factor binding sites based on a parametric uncertainty measurement (Renyi entropy). This detection algorithm evaluates the variation on the total Renyi entropy of a set of sequences when a candidate sequence is assumed to be a true binding site belonging to the set. The efficiency of the method is measured in form of receiver operating characteristic (ROC) curves on different transcription factors from Saccharomyces cerevisiae organism. The results are compared with other known motif detection algorithms such as Motif Discovery scan (MDscan) and multiple expectation-maximization (EM) for motif elicitation (MEME).

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 2 )