Prepare data for Microdeletion

Slides:



Advertisements
Similar presentations
AES Sub-Key Generation By Muhammad Naseem. Rotate Word 09CF4F3C.
Advertisements

Selinger Optimizer Lecture 10 October 15, 2009 Sam Madden.
Formal Verification of Hardware Support For Advanced Encryption Standard Anna Slobodová Centaur Technology This work was done while at Intel.
A B Q Chord AB is 18. The radius of Circle Q is 15. How far is chord AB from the center of the circle? 9 15 (family!) 12 x.
Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.
Chapter 5.2 Factoring by Grouping. 3y (2x – 7)( ) (2x – 7) (2x – 7) – 8 3y 1. Factor. GCF = (2x – 7) Find the GCF. Divide each term by the GCF. (2x –
E4004 Surveying Computations A Two Missing Distances.
Indicator A.a. Ability to measure and report on all other Oregon sustainable forest management indicators First update.
Combinations and Probability
Traveling Salesman Problems Repetitive Nearest-Neighbor and Cheapest-Link Algorithms Chapter: 6.
CPSC-608 Database Systems Fall 2011 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #8.
Whiteboardmaths.com © 2004 All rights reserved
Graph Partitioning Problem Kernighan and Lin Algorithm
6.3Find Probabilities Using Combinations
AES (Advanced Encryption Standard) By- Sharmistha Roy M.Tech, CSE 1 st semester NIT, Agartala.
CS555Spring 2012/Topic 101 Cryptography CS 555 Topic 10: Block Cipher Security & AES.
Find Probabilities Using Combinations
Computing the chromatic number for block intersection graphs of Latin squares Ed Sykes CS 721 project McMaster University, December 2004 Slide 1.
Phrase-structure grammar A phrase-structure grammar is a quadruple G = (V, T, P, S) where V is a finite set of symbols called nonterminals, T is a set.
9.3 Altitude-On-Hypotenuse Theorems (a.k.a Geometry Mean)
Chapter 11 – Counting Methods Intro to Counting Methods Section 11.1: Counting by Systematic Listing.
Cryptography Lecture 17: Advanced Encryption Standard (AES) Piotr Faliszewski.
AES Encryption FIPS 197, November 26, Bit Block Encryption Key Lengths 128, 192, 256 Number of Rounds Key Length Rounds Block.
A horse race has the following horses running. How many different first, second and third place results are possible: Mushroom Pepper Sausage Tomato Onion.
EMIS Lecture 16 - Chapter 8 Designing Mesh Networks.
A Valentines Day Problem Source The teachers lab Patterns in Mathematics
Geometry: Plane Figures Chapter. point A point marks a location. A A B B line segment the part of the line between 2 points endpoints.
1 CS 140 Discrete Mathematics Combinatorics And Review Notes.
ECE Prof. John A. Copeland fax Office: GCATT Bldg.
Mapreduce Examples. A B C D E F Breadth First Search.
9.3 Altitude-On-Hypotenuse Theorems (a.k.a Geometry Mean)
Graphs and Matrices Spring 2012 Mills College Dan Ryan Lecture Slides by Dan Ryan is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike.
南亚和印度.
VideoGameAudio.com info {at} VideoGameAudio.com SIAT – Simon Fraser University Surrey, BC 1 Video Game Audio Leonard J. Paul VideoGameAudio.c om.
or call for office visit, or call Kathy Cheek,
Lesson 10-6: Secants and Tangents and Angle Measures
Geometry 5-4 Midsegments
Proposition 36 Raman choubay.
PROPORTIONAL SEGMENTS & BASIC SIMILARITY THEOREM
Aim: Full House Grid: 9 Grid Play: Calculate answer & cross it off
Jan 2007.
Combinations COURSE 3 LESSON 11-3
It’s a powerpoint! SWEET!
The Advanced Encryption Standard: Rijndael
FP1 Matrices Introduction
Make an Organized List and Simulate a Problem
تصنيف التفاعلات الكيميائية
Directed Graphs (Part II)
Recapping: Vector addition.
Arranging and Choosing
Single Source Shortest Paths Bellman-Ford Algorithm
Rotors and Secret-Key Encryption
Splash Screen.
AB AC AD AE AF 5 ways If you used AB, then, there would be 4 remaining ODD vertices (C, D, E and F) CD CE CF 3 ways If you used CD, then, there.
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Splash Screen.
A Series of Slides in 5 Parts Movement 2. BFS
Latin Square Designs.
Splash Screen.
6.6 Finding Segment Lengths.
Vectors (2).
If AD = 10, DC =6, and ED = 15, find DB.
10.5 Permutations and Combinations.
刘振 上海交通大学 计算机科学与工程系 电信群楼3-509
A Series of Slides in 5 Parts Movement 4. Best-First
A Series of Slides in 5 Parts Movement 4. Best-First
Lesson 3-7: Secants and Tangents and Angle Measure
A Series of Slides in 5 Parts Movement 1. DFS
A Series of Slides in 5 Parts Movement 3. IDFS
Male FBN-ARO-KO mice exhibit cognitive defects but normal locomotor activity and anxiety levels. Male FBN-ARO-KO mice exhibit cognitive defects but normal.
Presentation transcript:

Prepare data for Microdeletion Jianfang Chen

1. Original Data Set.

(1) snp_homozygosity_data. (2) snp_location_data. (3) Parameter file. 2. Objective Data Sets. (1) snp_homozygosity_data. (2) snp_location_data. (3) Parameter file.

snp_homozygosity_data -- The first row is the title line snp_homozygosity_data -- The first row is the title line. The first column is affection_status (0 for controls, 1 for cases). The remaining columns are homozygosity data at each site ( 0 for missing, 1 for homozygotes, 2 for heterozygotes). Example of "snp_homozygosity_data" (with two controls, two cases, 6 SNPs): indicator v1 v2 v3 v4 v5 v6 0 0 1 1 2 1 2 0 1 2 2 1 0 1 1 1 1 1 0 2 1 1 2 1 2 1 1 1

snp_location_data -- The first row is the title line snp_location_data -- The first row is the title line. The first column is SNP index number. Second col is SNP location. The locations are sorted in increasing order. Example of "snp_location_data" (with 6 SNPs): order position 1 50530104 2 50531804 3 50550165 4 50571683 5 50574584 6 50574983

Parameter file -- It needs the following inputs (one input per line): snp_homozygosity_data_name, snp_location_data_name, output_file_name, num_cont, num_case, num_site, maximum_window_size, num_rep1

3. Algorithm sort orginal data by FamilyID, Position and Marker_name. remove one marker with duplicate position. for each family within a marker (3 individuals) leave child as case

combine father and mother into one line as control, based on the following algorithm: suppose father (a,b) mother (c,d) and child (e,f) if e=a and f=c then control will be (b,d) else if e=a and f=d then control will be (b,c) else if e=b and f=c then control will be (a,d) else if e=b and f=d then control will be (a,c) else if e=c and f=a then control will be (d,b) else if e=c and f=b then control will be (d,a) else if e=d and f=a then control will be (c,b) else if e=d and f=b then control will be (c,a)

else if a=1 and b=1 and c=1 and d=1 and e=2 and f=2 then control will be (1,1) else if a=2 and b=2 and c=2 and d=2 and e=1 and f=1 then control will be (2,2) else if a=1 and b=1 and c=1 and d=1 and e=2 and f=2 then control will be (1,1) else if a=2 and b=2 and c=2 and d=2 and e=1 and f=1 then control will be (2,2) else if a=1 and b=1 and c=2 and d=2 and e=1 and f=1 then control will be (1,2) else if a=2 and b=2 and c=1 and d=1 and e=1 and f=1 then control will be (1,2) else if a=1 and b=1 and c=2 and d=2 and e=2 and f=2 then control will be (1,2)

else if a=2 and b=2 and c=1 and d=1 and e=2 and f=2 then control will be (1,2) else if a=2 and b=2 and c=2 and d=2 and e=1 and f=2 then control will be (2,2) else if a=1 and b=1 and c=1 and d=1 and e=1 and f=2 then control will be (1,1) else control will be (0,0)

recode any combination of a,b,c,d pair(x,y) as if x*y=0 then output 0 else if x*y=2 then output 1 else output 2 dump out Middle Step Output as I put in the website. for each family "0" + line up of all parents recode_number got from step4. "1" + line up of all children recode_number got from step4.

data_all.txt data_clean.txt 4. Data sets. data_all.txt data_clean.txt