24 Pages

Winzeler.Genetics.2003

Course: PMB 290, Fall 2008
School: Berkeley
Rating:
 
 
 
 
 

Word Count: 7259

Document Preview

2003 Copyright by the Genetics Society of America Genetic Diversity in Yeast Assessed With Whole-Genome Oligonucleotide Arrays Elizabeth A. Winzeler,*,1 Cristian I. Castillo-Davis, Guy Oshiro,* David Liang,* Daniel R. Richards, Yingyao Zhou* and Daniel L. Hartl *Genomics Institute of the Novartis Research Foundation, San Diego, California 92121, Department of Organismic and Evolutionary Biology, Harvard...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> Berkeley >> PMB 290

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.
2003 Copyright by the Genetics Society of America Genetic Diversity in Yeast Assessed With Whole-Genome Oligonucleotide Arrays Elizabeth A. Winzeler,*,1 Cristian I. Castillo-Davis, Guy Oshiro,* David Liang,* Daniel R. Richards, Yingyao Zhou* and Daniel L. Hartl *Genomics Institute of the Novartis Research Foundation, San Diego, California 92121, Department of Organismic and Evolutionary Biology, Harvard University, Cambridge, Massachusetts 02138 and Department of Genetics, Stanford University School of Medicine, Stanford, California 95307 Manuscript received August 4, 2002 Accepted for publication October 21, 2002 ABSTRACT The availability of a complete genome sequence allows the detailed study of intraspecies variability. Here we use high-density oligonucleotide arrays to discover 11,115 single-feature polymorphisms (SFPs) existing in one or more of 14 different yeast strains. We use these SFPs to dene regions of genetic identity between common laboratory strains of yeast. We assess the genome-wide distribution of genetic variation on the basis of this yeast population. We nd that genome variability is biased toward the ends of chromosomes and is more likely to be found in genes with roles in fermentation or in transport. This subtelomeric bias may arise through recombination between nonhomologous sequences because full-gene deletions are more common in these regions than in more central regions of the chromosome. ITH few exceptions, only one strain or an individual of a particular species is sequenced while hundreds of other variants, which may be important to public health, scientic research, or commercial applications, remain undeciphered. In the bakers yeast, Saccharomyces cerevisiae, a derivative of strain S288c was sequenced. Despite the availability of the sequence information for this strain, many full-genome studies, including gene expression studies (Chu et al. 1998), genome-wide chromatin-binding studies (Wyrick et al. 2001), and studies of the replication dynamics of the yeast genome (Raghuraman et al. 2001), have been conducted using alternative but commonly used yeast strains. In some cases, the strain may be directly related to S288c (A364, W303, and 1278b derivatives) and in some cases the strain may be completely unrelated (SK1). As many of these studies rely on oligonucleotide or cDNA arrays that were derived from S288c sequence information, the quality of the data may differ depending on the region of the genome under investigation and on whether or not the region is identical by descent to that of S288c. These strain differences could contribute to some of the inconsistencies in genomewide data sets (Grunenfelder and Winzeler 2002). Mortimer and Johnston (1986) have traced the pedigrees of some laboratory yeast strains as far as is known, but direct ascertainment of the relationships between laboratory strains, in the absence of full-genome sequencing, has been impossible. W 1 Corresponding author: Department of Cell Biology, The Scripps Research Institute, 10550 Torrey Pines Rd., La Jolla, CA 92037. Single-base changes between two sequences 25 bp in length, especially those found in the central region of a 25mer, disrupt their hybridization (Chee et al. 1996; Gingeras et al. 1998; Troesch et al. 1999; Lockhart and Winzeler 2000). Thus, with oligonucleotide arrays carrying large numbers of probes of this length (termed features), the approximate location of allelic variation between two strains can be discovered (Winzeler et al. 1998). Since the locations of all the features in the genome are generally known, the approximate position of a predicted polymorphism between the two strains can also be ascertained when the genomic DNA hybridization patterns are compared (Figure 1). Such hybridization differences have been termed single-feature polymorphisms (SFPs; Borevitz et al. 2003). The Affymetrix S98 oligonucleotide array contains 285,156 different 25mers from the yeast genomic sequence. Although this array was designed primarily to be a tool for gene expression analysis, it was also created to maximize the amount of yeast genome sequence covered. In addition to probes to all annotated genes in the yeast genome, probes to small nonannotated genes (Oshiro et al. 2002), probes to nontranslated RNA, and probes to noncoding regions were included in the design. Although a percentage of these probes overlap one another, altogether 16% of the yeast genome is probed by this array design. We reasoned that because of the high degree of coverage, these arrays could be used to identify a signicant proportion of the genetic variation existing between strains and that this information could then be used to determine strain relationships. In addition, through the inclusion of several wild isolates, we have characterized the distribution of allelic Genetics 163: 7989 ( January 2003) 80 E. A. Winzeler et al. Figure 1.Example of hybridization pattern for probes that detect nonvariant (A) or variant (B) alleles. The ...
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 - PMB - 290
DNA microarray analysis of gene expression in response to physiological and genetic changes that affect tryptophan metabolism in Escherichia coliArkady B. Khodursky*, Brian J. Peter, Nicholas R. Cozzarelli, David Botstein, Patrick O. Brown*, and Cha
Berkeley - PMB - 290
Genome-wide analysis of mRNA translation profiles in Saccharomyces cerevisiaeYoav Arava*, Yulei Wang*, John D. Storey, Chih Long Liu*, Patrick O. Brown*, and Daniel Herschlag**Department of Biochemistry, Stanford University, Stanford, CA 94305-5307
Berkeley - PMB - 290
Transcriptional response of Saccharomyces cerevisiae to DNA-damaging agents does not identify the genes that protect against these agentsGeoff W. Birrell*, James A. Brown*, H. Irene Wu*, Guri Giaever, Angela M. Chu, Ronald W. Davis, and J. Martin Br
Berkeley - PMB - 290
Global mapping of meiotic recombination hotspots and coldspots in the yeast Saccharomyces cerevisiaeJennifer L. Gerton*, Joseph DeRisi, Robert Shroff, Michael Lichten, Patrick O. Brown, and Thomas D. Petes**Department of Biology and Curriculum in G
Berkeley - PMB - 290
Parallel phenotypic analysis of sporulation and postgermination growth in Saccharomyces cerevisiaeAdam M. Deutschbauer*, Roy M. Williams, Angela M. Chu, and Ronald W. Davis*Departments of *Genetics and Biochemistry, Stanford University School of Me
Berkeley - PMB - 290
Toward a protein profile of Escherichia coli: Comparison to its transcription profileRebecca W. Corbin*, Oleg Paliy, Feng Yang*, Jeffrey Shabanowitz*, Mark Platt*, Charles E. Lyons, Jr.*, Karen Root*, Jon McAuliffe, Michael I. Jordan, Sydney Kustu ,
Berkeley - PROP - 13
Bill.Fischel@Dartmouth.edu 6 June 2008Fischel, William A.1989. Did Serrano Cause Proposition 13? National Tax Journal 42: 465-474. _ 1996. How Serrano Caused Proposition 13. Journal of Law and Politics 12: 607-645. _ Did John Serrano Vote for Propo
Berkeley - PRESENTATI - 2001
University of California, Riverside Bourns College of EngineeringModeling Energy and Emissions from Heavy Duty Diesel VehiclesCalifornia PATH Program-Wide Research Meeting October 17-18, 2001Presented By: Matthew Barth University of California, R
Berkeley - PH - 240
PH 240D Biostatistical Methods: Applications of Statistics to Genetics and Molecular Biology Spring 2003Time Location CCN Units Instructor. Sandrine Dudoit E-mail: sandrine@stat.berkeley.edu Website: www.stat.berkeley.edu/~sandrine Oce hours: Tu 3:
Berkeley - BIRS - 04
Asymmetric Laplace Distribution for Gene Expression DataIntroductionThe distribution of the normalized gene expressions, while similar for different arrays, is often far from normal regardless of the normalization methods. Rather, the distribution
Berkeley - BIRS - 04
Software design for loss-based estimation with the D/S/A algorithmKasper Daniel Hansenjoint work with Sandrine Dudoit and Mark van der LaanIntroduction (1) This poster deals with the implementation in R of the estimation road map proposed by van d
Berkeley - BIRS - 04
Statistics and Sequence AlignmentLior Pachter Department of Mathematics U.C. BerkeleyJoint work with Marina Alexandersson, Nicolas Bray, Colin Dewey , Simon Cawley, Colin Dewey, Fumei Lam and Bernd SturmfelsQuickTime and a TIFF (Uncompressed) dec
Berkeley - BIRS - 04
Graphical Modeling for Many Variables, and an Application to Genetic Regulatory SubnetworksPeter Buhlmann ETH Zurich 11. Associations between Variableswell studied framework: determine presence/absence of associations between random variables
Berkeley - BIRS - 04
S S GectionONtatistical eneticsDavid B. Allison, Ph.D. ProfessorDepartment of Biostatistics Dept of Nutrition Sciences Clinical Nutrition Research Unit School of Public HealthRecruitment actively underway for post-doctoral fellows research
Berkeley - BIRS - 04
The Application of Multiple Testing Procedures to Detect Genotype/Phenotype Associations.Merrill Birkner (1), Mlanie Courtine (2), Sandrine Dudoit (1), e Mark van der Laan (1), Karine Clment (2), and Jean-Daniel Zucker (2) e1 Division of Biostati
Berkeley - BIRS - 04
Semantic web methodologies for statistical genomics VJ Carey Banff 2004 !"#Overviewmotivations: needs and benets of explicit semantics examples: reading a journal with R extracting design ontology from MAGE-OM P
Berkeley - BIRS - 04
Studying the Immune System and Cancer with Multivariate Statistics and MicroarraysSusan Holmes Statistics Department, Stanford University Collaboration with Peter P Lee from Stanfords Hematology Department Elizabeth Purdom, Statistics, Stanford. Wor
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