Abstract #301225

This is the preliminary program for the 2003 Joint Statistical Meetings in San Francisco, California. Currently included in this program is the "technical" program, schedule of invited, topic contributed, regular contributed and poster sessions; Continuing Education courses (August 2-5, 2003); and Committee and Business Meetings. This on-line program will be updated frequently to reflect the most current revisions.

To View the Program:
You may choose to view all activities of the program or just parts of it at any one time. All activities are arranged by date and time.

The views expressed here are those of the individual authors
and not necessarily those of the ASA or its board, officers, or staff.


Back to main JSM 2003 Program page



JSM 2003 Abstract #301225
Activity Number: 374
Type: Contributed
Date/Time: Wednesday, August 6, 2003 : 10:30 AM to 12:20 PM
Sponsor: Biopharmaceutical Section
Abstract - #301225
Title: Composite Motif Prediction Using the Regulatory Module Sampler
Author(s): Mayetri Gupta*+ and Jun S. Liu
Companies: Harvard University and Harvard University
Address: Dept. of Statistics, Cambridge, MA, 02138-2901,
Keywords: gene regulation ; regulatory module ; evolutionary Monte Carlo ; hidden Markov models
Abstract:

A better understanding of gene regulatory networks could lead to momentous advances in medical research and drug discovery. Accurate discovery of regulatory binding sites (motifs), conserved patterns in DNA sequences, is a first necessary step. In eukaryotic genomes, motif detection is a challenging problem as motifs tend to be short, variable, and occur in multi-pattern clusters (regulatory modules). In this paper we introduce a Bayesian methodology for state-space model selection and parameter estimation in hidden Markov models, and apply it to the location of regulatory modules. Given a potentially large and diverse starting set of motif profile matrices we need to find motif classes comprising the module and the location of sites. The module framework assumes an underlying Markov structure for the position of sites on the sequence and also the order of pattern types. A fast algorithm based on evolutionary Monte Carlo (Liang and Wong 2000) enables us to detect likely clusters comprising the module and obtain improved parameter estimates. The performance of the new method will be demonstrated by both simulation studies and applications to bacterial and human genomes.


  • The address information is for the authors that have a + after their name.
  • Authors who are presenting talks have a * after their name.

Back to the full JSM 2003 program

JSM 2003 For information, contact meetings@amstat.org or phone (703) 684-1221. If you have questions about the Continuing Education program, please contact the Education Department.
Revised March 2003