JSM 2005 Online Program

Abstract #302433

This is the preliminary program for the 2005 Joint Statistical Meetings in Minneapolis, Minnesota. Currently included in this program is the "technical" program, schedule of invited, topic contributed, regular contributed and poster sessions; Continuing Education courses (August 7-10, 2005); 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.

The Program has labeled the meeting rooms with "letters" preceding the name of the room, designating in which facility the room is located:

Minneapolis Convention Center = “MCC” Hilton Minneapolis Hotel = “H” Hyatt Regency Minneapolis = “HY”

Back to main JSM 2005 Program page

Legend:

= Applied Session,

= Theme Session,

= Presenter

Activity Number:	206
Type:	Invited
Date/Time:	Tuesday, August 9, 2005 : 8:30 AM to 10:20 AM
Sponsor:	SSC
Abstract - #302433
Title:	Waiting Times for Structured Motifs in Random Sequences
Author(s):	Valeri Stefanov*+ and Stephane Robin and Sophie Schbath
Companies:	The University of Western Australia and Institut National Agronomique and INRA
Address:	School of Mathematics and Statistics, , Crawley, 6009, Australia
Keywords:	structured motif ; waiting time ; generating function
Abstract:	A structured motif is composed of two patterns separated by a variable distance. The waiting time until the first occurrence of a structured motif is of interest. This interest is due to the biological challenge of identifying promoter motifs along genomes. Programs to extract automatically structured motifs from DNA sequences exist. Only statistically significant motifs should be suggested to biologists such as candidate promoters. The statistical significance of a motif in a sequence is identified through the probability the sequence contains at least one occurrence of the motif. In this talk, we will provide an explicit expression for the generating function of the waiting time until reaching a structured motif for the first time. This leads to exact evaluation of the aforementioned probability.

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 2005 program