70 Pages

holmes

Course: BIRS 04, Fall 2009
School: Berkeley
Rating:
 
 
 
 
 

Word Count: 4197

Document Preview

the Studying Immune System and Cancer with Multivariate Statistics and Microarrays Susan Holmes Statistics Department, Stanford University Collaboration with Peter P Lee from Stanfords Hematology Department Elizabeth Purdom, Statistics, Stanford. Work supported by the ACS and the NSF DMS grant 02-41246. Ban, August 19th, 2004 Thanks to Bioconductor contributors, in particular Sandrine Dudoit, Jean Yee, Wolfgang...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> Berkeley >> BIRS 04

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
the Studying Immune System and Cancer with Multivariate Statistics and Microarrays Susan Holmes Statistics Department, Stanford University Collaboration with Peter P Lee from Stanfords Hematology Department Elizabeth Purdom, Statistics, Stanford. Work supported by the ACS and the NSF DMS grant 02-41246. Ban, August 19th, 2004 Thanks to Bioconductor contributors, in particular Sandrine Dudoit, Jean Yee, Wolfgang Huber. A little immunology T-lymphocyte cells (T-cells) originally derive from stem cells of the bone marrow. At around the time of birth, lymphocytes derived in this way leave the marrow and pass to the thymus gland in the chest, where they multiply. The lymphocytes are processed by the thymus gland, so that between them they carry the genetic information necessary to react with a multitude of possible antigens. Antigens The human genome is presently estimated to contain as few as 25 thousand genes (we should soon know the number exactly). The number of T-cell receptors for antigen (TCRs) that we make is estimated at 25x106 Antigens are macromolecules that elicit an immune response in the body. Antigens can be proteins, polysaccharides, conjugates of polysacharides and proteins. T-cell diversity is attained by a complex 5-stage genetic rearrangement that occurs at random in the developing T-cells in the thymus. T-cells are tested for their ability to recognise and bond to antigens in the thymus. It is thought that this occurs by positive and negative selection. The postulation is that positive selection eliminates T-cells that do not bond tightly enough to antigen type molecules produced in the thymus and negative selection eliminates T-cells that bond too tightly to self type molecules found in the thymus. This produces a mature T-cell that is eective against antigens but is also self tolerant. It is known that approximately 95% of all developing T-cells die in the thymus. The T-cells, each processed to recognise and interact with a specic antigen, circulate permanently between the blood and lymphatic systems. On recognition of the antigen by a helper T-cell, one or a group of lymphocytes takes up residence in secondary lymphoid tissue (e.g. lymph glands, spleen, bone marrow) and divides to form two types of cells, memory cells, which are lymphocytes processed in the same way as themselves, and killer cells, which interact with the antigen. T-cell receptor sites sit on the surface of T cells and provide the specicity in antigen binding They have two components that give each dierent type a unique surface morphology and it is this that allows bonding to antigens. This enhanced electron microscope picture shows a Killer T-cell (top right) about to attack a larger cancer cell. T cell populations in the periphery T...
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Berkeley - BIRS - 04
Finding anomalously expressed genes in the brain tissue of Alzheimer patientsAlan Hubbard, Simon Melov, David Bennet, Mary Lopez1 2 3 1 UC Berkeley, SPH2 3 44Buck Institute Rush University Medical CenterPerkinElmerAcknowledgements Contrib
Berkeley - BIRS - 04
Multiple Testing Methods For ChIP-Chip High Density Oligonucleotide Array DataS nd z Kele u u sDepartment of Statistics and of Biostatistics & Medical InformaticsUniversity of Wisconsin, MadisonBIRS Workshop, Statistical Science for Genome Bio
Berkeley - BIRS - 04
A Deletion/Substitution/Addition Algorithm for Optimization of Neural Network ArchitectureBlythe Durbin Division of Biostatistics, UC Berkeley jointly with Sandrine Dudoit and Mark van der LaanBIRS Workshop Statistical Science for Genome Biology A
Berkeley - BIRS - 04
Multiple Hypothesis Testing for High Dimensional Biological DataKatherine S. Pollard Center for Biomolecular Science & Engineering University of California, Santa CruzPage 1High Dimensional Biological DataAdvances in technology allow us to coll
Berkeley - BIRS - 04
Improving the Reliability of Results from Genome-Wide StudiesShelley B. Bull, Samuel Lunenfeld Research Institute, and Dept of Public Health Sciences, University of Toronto Joint work with Lei Sun, Dept of Public Health Sciences, and Long Yang Wu, L
Berkeley - BIRS - 04
The D/S/A Algorithm with Polynomial Basis FunctionsSandra E. SinisiDivision of Biostatistics, UC Berkeley ssinisi@stat.berkeley.edu Primary Reference: http:/www.bepress.com/sagmb/vol3/iss1/art18 Technical Reports: http:/www.bepress.com/ucbbiostat
Berkeley - PH - 296
Inferring Protein Interactions From Phylogenetic Distance MatricesGertz, J. et al. Bioinformatics, 2003, 19 (16): 2039-2045Peter Dimitrovdimitrov@stat.berkeley.eduInferring Protein Interactions From Phylogenetic Distance Matrices p.1/16Outlin
Berkeley - PH - 292
Database mining with biomaRtSteffen DurinckLawrence Berkeley National Laboratory and Division of Biostatistics, UC BerkeleyStatistics and Genomics seminar August 2007Overview The BioMart software suite biomaRt package for R Workshop style bi
Berkeley - PH - 296
1 The Affymetrix platform for gene expression analysis Affymetrix recommended QA procedures The RMA model for probe intensity data Application of the fitted RMA model to quality assessment23Probes are 25-mers selected from a target mRNA se
Berkeley - MATH - 16
016A Homework 6 SolutionJae-young Park October 6, 2008 2.1 *4 Which functions have the property that the slope always decreases as x increases? Solution (a), (e). You can nd these answers by nding the graphs which is convave down everywhere. For (
Berkeley - MATH - 128
Math 128a - Homework 2 - Due Feb 14 at the beginning of class 1) Complete Question 4 from Homework 1, which was postponed due to delayed availability of computer accounts. 2) In this question we will write a program to explore the sensitivity of root
Berkeley - CS - 267
CS 267 Applications of Parallel Computers Lecture 9: Split-C James Demmelhttp:/www.cs.berkeley.edu/~demmel/cs267_Spr99CS267 L9 Split-C Programming.1Demmel Sp 1999Comparison of Programming Models Data Parallel (HPF) Good for regular applicat
Berkeley - MATH - 128
Math 128a - Program 1 - Due March 14 Your assignment is to implement a program which computes and plots a curve in the x, y plane, dened as the solution of a implicit equation f (x, y) = 0. Your inputs will be 1. A function that evaluates f (x, y), f
Berkeley - MATH - 16
Solutions prepared by Danielle Champney, ddchamp@berkeley.edu Sections 102 and 110 Homework 4 Solutions Section 1.4: 18, 22, 36, 48, 52 18. lim 22. lim 2 1 1 ( + 1) = lim = lim + 1 = 2 1 1 1 1 1 2 10 2( 5) 2 1 = lim = lim = 2 25 5 5 5
Berkeley - MATH - 16
Problem 2.3.6 1 Solution: f (x) = 4x2 1 = (2x 1)(2x + 1) = 0 x = 1 , 2 . f is positive 2 1 1 1 on (, 2 ) ( 1 , ) and negative on ( 1 , 1 ). So ( 2 , f ( 2 ) = 8 ) is the 2 22 3 1 relative maximum and ( 2 , f ( 1 ) = 4 ) is the relative minimum.
Berkeley - CS - 170
CS170First Midterm NAME: TA: Key (see below):23 Sep 1999Be clear and concise. You may use the number of points assigned to each problem as a rough estimate for the number of minutes you want to allocate to the problem. The total number of point
Berkeley - MATH - 128
Math 128a - Final - Spring 2002 This exam is open book, open notes, open calculator (you shouldnt need one). The total score is 130 points. The number of points approximately indicates the number of minutes you should spend on the problem. 1) (35 poi
Berkeley - MATH - 128
File FloTrikA Floating-Point Trick version dated May 22, 2007 5:08 pmA Floating-Point Trick to Solve Boundary-Value Problems FasterProf. W. Kahan Math. and Computer Sci. Depts. Univ. of Calif. @ Berkeley0. Abstract: These notes resuscitate a
Berkeley - CS - 188
CS 188 Fall 20051. (12 pts.)Introduction to AI Stuart RussellSome Easy Questions to Start WithFinal Solutions(a) (2) True. This follows from the property that each variable is independent of its predecessors given its parents. Since X1 , . .
Berkeley - CS - 188
Temporal probability modelsChapter 15, Sections 15Chapter 15, Sections 151Outline Time and uncertainty Inference: ltering, prediction, smoothing Hidden Markov models Kalman lters (a brief mention) Dynamic Bayesian networks Particle lter
Berkeley - CS - 188
NAME:SID#:Section:1CS 188 Fall 2005Introduction to AI Stuart RussellFinalYou have 2 hours and 50 minutes. The exam is open-book, open-notes. 100 points total. Panic not. Mark your answers ON THE EXAM ITSELF. Write your name, SID, and se
Berkeley - CS - 188
NAME:SID#:Section:1CS 188 Spring 2005Introduction to AI Stuart RussellFinalYou have 2 hours and 50 minutes. The exam is open-book, open-notes. 100 points total. Panic not. Mark your answers ON THE EXAM ITSELF. Write your name, SID, and
Berkeley - CS - 188
CS 188 Fall 20051. (12 pts.)Introduction to AI Stuart RussellTrue/FalseMidterm Solution(a) (2) True; both because it is often possible to make changes to an environment without aecting optimal action choices (e.g., small changes to outcome pr
Berkeley - CS - 188
CS 188 Spring 20051. (12 pts.)Introduction to AI Stuart RussellFinal SolutionSome Easy Questions to Start With(a) (2) False. DBNs can include continuous variables. (b) (2) True. The two clauses resolve to give Q(F (F (z), which entails Q(F (
Berkeley - CS - 188
CS 188 Spring 20051. (12 pts.)Introduction to AI Stuart RussellMidterm SolutionTrue/False(a) (2) True/False: There exists a task environment (PEAS) in which every agent is rational. TRUE: e.g., let the performance measure be zero for every h
Berkeley - CS - 188
Propositional inference, propositional agentsChapter 7.57.7Chapter 7.57.71Outline Inference rules and theorem proving forward chaining backward chaining resolution Ecient model checking algorithms Boolean circuit agentsChapter 7.57.7
Berkeley - CS - 188
NAME:SID#:Login:Sec:1CS 188 Fall 2005Introduction to AI Stuart RussellMidtermYou have 80 minutes. The exam is open-book, open-notes. 100 points total. Panic not. Mark your answers ON THE EXAM ITSELF. Write your name, SID, login, and s
Berkeley - CS - 188
Rational decisionsChapter 16Chapter 161Outline Rational preferences Utilities Money Multiattribute utilities Decision networks Value of informationChapter 162PreferencesAn agent chooses among prizes (A, B, etc.) and lotteries, i.
Berkeley - CS - 188
NAME:SID#:Section:1CS 188 Spring 2005Introduction to AI Stuart RussellMidtermYou have 80 minutes. The exam is open-book, open-notes. 100 points total. Panic not. ALL QUESTIONS IN THIS EXAM ARE TRUE/FALSE, MULTIPLE-CHOICE, OR SHORT-ANSWE
Berkeley - CS - 70
These are notes on Gdels Theorem and Turings proof of the undecidability of the halting problem, o taken from a longer naration. 1. GODELS PROOFSubject: Splean From: bald@math.unitrieste.it Date: July 19, 1999. 2:15 (GST) It is a hot summer night
Berkeley - CS - 70
CS 70 Spring 2008 InvariantsDiscrete Mathematics for CS David WagnerNote 5We have a robot that lives on an innite grid. Initially, it is at position (0, 0). At any point, it can take a single step in one of four directions: northeast, northwest
Berkeley - CS - 70
CS 70 Spring 2008 FingerprintingDiscrete Mathematics for CS David WagnerNote 12Suppose we just finished transmitting an enormous file to the Moon. We'd like to verify that our file got there correctly, without any errors. We could of course re-
Berkeley - CS - 70
Discrete Mathematics and Probability TheoryComputer Science 70 Lecture 23(www.cs.berkeley.edu/~ddgarcia)Big Idea: memoization General principle: store rather than recompute. Context is a tree-recursive algorithm with lots of repeated computati
Berkeley - CS - 70
CS 70 Spring 2008Discrete Mathematics for CS David WagnerNote 9Modular ArithmeticOne way to think of modular arithmetic is that it limits numbers to a predened range {0, 1, . . . , N 1}, and wraps around whenever you try to leave this range
Berkeley - CS - 261
CS 261: Computer SecurityFall 2007Nov 13: CryptographyLecturer: David Wagner Scribe: Gunho Lee1How to solve security problem?Here is a trajectory how people (and I) think about this problem.1.1Security is a cryptographic problem.Many
Berkeley - CS - 70
CS 70 Spring 2008 Lesson PlanDiscrete Mathematics for CS David WagnerNote 2In order to be uent in mathematical statements, you need to understand the basic framework of the language of mathematics. This rst week, we will start by learning about
Berkeley - CS - 70
CS 70 Fall 2000Discrete Mathematics for CS WagnerMT1 SolSolutions to Midterm 11. (16 pts.) Theorems and proofs (a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are rational they can be written as the ratio of
Berkeley - CS - 70
CS 70 Spring 2008Discrete Mathematics for CS David WagnerNote 11Error Correcting CodesErasure ErrorsWe will consider two situations in which we wish to transmit information on an unreliable channel. The first is exemplified by the internet, w
Berkeley - CS - 170
UC BerkeleyCS 170 Lecturer: David WagnerProblem Set 9 Due on April 17 at 3:30 p.m.Problem Set 9 for CS 170Formatting Please use the following format for the top of the solution you turn in, with one line per item below (in the order shown below)
Berkeley - CS - 70
CS 70 Spring 2008Discrete Mathematics for CS David WagnerNote 6Well Ordering PrincipleHow can the induction axiom fail to be true? Recall that the axiom says the following: [P(0) (n . P(n) = P(n + 1)] = n . P(n). What would it take for n N .
Berkeley - CS - 70
CS 70 Spring 2008Discrete Mathematics for CS David WagnerNote 8Cake Cutting and Fair Division AlgorithmsThe cake-cutting problem is as follows. We have a cake, to be shared among n of us, and we want to split it amongst themselves fairly. Howe
Berkeley - CS - 276
U.C. Berkeley CS276: Cryptography Professor David WagnerLecture 30 May 9, 2006Lecture 30 Fun Topics 11.1Secret SharingSecret sharing backgroundConsider a bank vault locked with a combination lock, and n bank vice presidents that need to b
Berkeley - CS - 70
CS 70 Spring 2008P RINT your name:Discrete Mathematics for CS David Wagner,(last)Final Exam(rst)S IGN your name: P RINT your Unix account login: Your section time (e.g., Tue 3pm): Name of the person sitting to your left: Name of the person
Berkeley - MATH - 185
File: DSpr2p43Solution for Ex. 2 p.43 of Sarasons NotesOctober 16, 2006 10:18 amExercise 2 p. 43: Let be a complex number of unit modulus and an irrational real number. Prove that the values of form a dense subset of the unit circle. Solutio
Berkeley - CS - 262
Advanced Topics in Computer Systems, CS262B Prof Eric A. BrewerPractical Byzantine Fault ToleranceMarch 11, 2004[updated 3/12/04]I. MotivationWe need to make systems work without having trust all of the components. We call faults with arbitrar
Berkeley - CS - 174
CS174 Lecture 18Byzantine AgreementThis lecture, we describe the Byzantine agreement problem. Given n processors, the goal is to have all processors agree on a binary decision. This is a basic and deceptively difficult task in distributed computing
Berkeley - CS - 18
CS174 Lecture 18Byzantine AgreementThis lecture, we describe the Byzantine agreement problem. Given n processors, the goal is to have all processors agree on a binary decision. This is a basic and deceptively difficult task in distributed computing
Berkeley - CS - 174
CS174Formula SheetX u; Y=John CannyY v1 X= PrIndependence: Random variables X , Y are independent iff for all values u and v ,Pr =v= PrX u=Pr=Expected Value: The expected value EEX=X of X :EXX=kkPrX k=
Berkeley - CS - 174
Solutions for CS174 Homework 1Pr Y = 1 = 1=3; Pr Y = 1jX = 1 = 2=3; so Pr Y = 1jX = 1 6= Pr Y = 1 . Therefore X and Y are not independent. E XY = 1 Pr X = 1; Y = 1 + 0 Pr X = 1; Y = 0 + Pr X = 0; Y = 1 + Pr X = 0; Y = 0 = 1=3:Solution 1. Solutio
Berkeley - CS - 12
CS174 Lecture 12Program CheckingMany application programs (e.g. air traffic control, financial management) have become so complicated that its very difficult to discover and correct errors and produce a correct (or sufficiently correct) program. Pr
Berkeley - CS - 174
CS174 Lecture 12Program CheckingMany application programs (e.g. air traffic control, financial management) have become so complicated that its very difficult to discover and correct errors and produce a correct (or sufficiently correct) program. Pr
Berkeley - CS - 174
CS174 Lecture Note 4Based on notes by Alistair Sinclair, September 1998; based on earlier notes by Manuel Blum/Douglas Young. More on random permutations We might ask more detailed questions, such as: Q3: What is the probability that contains at le
Berkeley - CS - 4
CS174 Lecture Note 4Based on notes by Alistair Sinclair, September 1998; based on earlier notes by Manuel Blum/Douglas Young. More on random permutations We might ask more detailed questions, such as: Q3: What is the probability that contains at le
Berkeley - CS - 174
CS174Lecture 3John CannyRandomized Quicksort and BSTsA couple more needed results about permutations: Q1: Whats the probability that 4 comes before 5 in a random permutation? Tempting to say 1/2, but why? For every permutation where 4 is befor
Berkeley - CS - 174
Solutions for CS174 Homework 4Consider a nal stable marriage. Because all the males have the same preference ordering, then we can assign each female a unique number k representing her ranking on the lists. Female k has a spouse, and she must be th
Berkeley - CS - 4
Solutions for CS174 Homework 4Consider a nal stable marriage. Because all the males have the same preference ordering, then we can assign each female a unique number k representing her ranking on the lists. Female k has a spouse, and she must be th
Berkeley - CS - 174
CS174 CryptographyLecture 21John CannyThe idea of cryptography is to protect data by transforming into a representation from which the original is hard to recover. These days many networking technologies (internet, wireless) allow many agents t
Berkeley - CS - 21
CS174 CryptographyLecture 21John CannyThe idea of cryptography is to protect data by transforming into a representation from which the original is hard to recover. These days many networking technologies (internet, wireless) allow many agents t
Berkeley - CS - 17
CS174 Lecture 17Minimum Spanning TreesRemember the minimum spanning tree problem from CS170 you are given a graph G with weighted edges (real values on each edge) and the goal is to find a spanning tree T whose total weight is minimal. The minimum
Berkeley - CS - 174
CS174 Lecture 17Minimum Spanning TreesRemember the minimum spanning tree problem from CS170 you are given a graph G with weighted edges (real values on each edge) and the goal is to find a spanning tree T whose total weight is minimal. The minimum
Berkeley - CS - 174
CS174Lecture 25John CannySecret Sharing and Threshold DecryptionThe goal of secret-sharing is to divide a secret S into n pieces S1 , . . . , Sn such that any m + 1 pieces are sufcient to reconstruct S, but any m pieces give no information abo