|
Published Articles >> Table of Contents >> Abstract
IEEE Computer Society Bioinformatics Conference (CSB'02)
p. 237
A Maximum Entropy Algorithm for Rhythmic Analysis of Genome-Wide Expression Patterns
Christopher James Langmead, Dartmouth University
C. Robertson McClung, Dartmouth University
Bruce Randall Donald, Dartmouth University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSB.2002.1039346
Send link to a friend
| Abstract |
|
We introduce a maximum entropy-based analysis technique for extracting and characterizing rhythmic expression profiles from DNA microarray hybridization data. These patterns are clues to discovering genes implicated in cell-cycle, circadian, and other periodic biological processes. The algorithm, implemented in a program called ENRAGE (Entropy-based Rhythmic Analysis of Gene Expression), treats the task of estimating an expression profile’s periodicity and phase as a simultaneous bicriterion optimization problem. Specifically, a frequency domain spectrum is reconstructed from a time-series of gene expression data, subject to two constraints: (a) the likelihood of the spectrum and (b) the Shannon entropy of the reconstructed spectrum. Unlike Fourier-based spectral analysis, maximum entropy spectral reconstruction is well suited to signals of the type generated in DNA microarray experiments. Our algorithm is optimal, running in linear time in the number of expression profiles. Moreover, an implementation of our algorithm runs an order of magnitude faster than previous methods. Finally, we demonstrate that ENRAGE is superior to other methods at identifying and characterizing periodic expression profiles on both synthetic and actual DNA microarray hybridization data.
|
 Additional Information
|
Citation:
Christopher James Langmead, C. Robertson McClung, Bruce Randall Donald,
"A Maximum Entropy Algorithm for Rhythmic Analysis of Genome-Wide Expression Patterns,"
csb,
p. 237,
IEEE Computer Society Bioinformatics Conference (CSB'02),
2002
|
|
