JSM 2005 Online Program

Abstract #304150

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:	193
Type:	Contributed
Date/Time:	Monday, August 8, 2005 : 2:00 PM to 3:50 PM
Sponsor:	Section on Nonparametric Statistics
Abstract - #304150
Title:	Determining the Copy Number States from Array CGH Data
Author(s):	E. Venkatraman*+ and Adam Olshen
Companies:	Memorial Sloan-Kettering Cancer Center and Memorial Sloan-Kettering Cancer Center
Address:	1275 York Avenue, New York, NY, 10021, United States
Keywords:	DNA copy number ; Array CGH ; Circular binary segmentation
Abstract:	DNA sequence copy number is the number of copies of DNA at a region of a genome. Cancer progression often involves alterations in DNA copy number. Olshen et al. (2004) proposed the Circular Binary Segmentation algorithm to segment the genome into regions of equal copy number. The implementation of the algorithm requires computing the p-value of the maximal statistic using a permutation reference distribution. The number of computations required for it grows at a rate proportional to the square of the number of markers in the chromosome being segmented. With the advent of high-density chips with markers numbering in hundreds of thousands, this becomes computationally infeasible. We will present refinements to the algorithm for determining the number of copy number states in linear time and for assigning the markers to these states.

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