logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Result file should contain 14 columns which are given as follows CHROM,POS,ID,REF,ALT,ALLELEID,CLNHGVS,CLNSIG,CLNVC,ORIGIN,RS,G ene_ID,Gene_symbol,Consequence

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Assignment 2 - Processing VCF file

1. Download the vcf file from https://spliceatlas.s3.amazonaws.com/clinvar_20220227_10K.vcf

2. File contains 10,000 lines

3. This is a kind of tsv file (tab separated values)

4. Line containing single # is the header. This contains the column headers

5. File will contain the following 8 columns (tab separated).

a. CHROM

b. POS

c. ID

d. REF

e. ALT

f. QUAL

g. FILTER

h. INFO

6. 2 lines from file is given here as a sample

a. #CHROM POS ID REF ALT QUAL FILTER INFO

b. 1     861332 1019397 G      A      .      .

ALLELEID=1003021;CLNDISDB=MedGen:CN517202;CLNDN=not_provided;CL

NHGVS=NC_000001.10:g.861332G>A;CLNREVSTAT=criteria_provided,_single

_submitter;CLNSIG=Uncertain_significance;CLNVC=single_nucleotide_variant;C LNVCSO=SO:0001483;GENEINFO=SAMD11:148398;MC=SO:0001583|missens e_variant;ORIGIN=1;RS=1640863258

c.   1     865519 1125147 C      T      .      .

ALLELEID=1110865;CLNDISDB=MedGen:CN517202;CLNDN=not_provided;CL

NHGVS=NC_000001.10:g.865519C>T;CLNREVSTAT=criteria_provided,_single_ submitter;CLNSIG=Likely_benign;CLNVC=single_nucleotide_variant;CLNVCSO

=SO:0001483;GENEINFO=SAMD11:148398;MC=SO:0001627|intron_variant;OR IGIN=1

7. Produce a output/result file (filename_of_ur_choice.csv - comma separated values) containing 14 columns by processing the downloaded file

a. Result file should contain 14 columns which are given as follows CHROM,POS,ID,REF,ALT,ALLELEID,CLNHGVS,CLNSIG,CLNVC,ORIGIN,RS,G ene_ID,Gene_symbol,Consequence

b. CHROM,POS,ID,REF,ALT can be collected directly from the first 5 columns of downloaded vcf file

c. To collect remaining data please use the last/8th col (INFO)

i. 8th col values are separated by ‘;’

ii. 8th col will have Attribute=value;Attribute=value;Attribute=value; and so on

 

iii. ALLELEID,CLNHGVS,CLNSIG,CLNVC,ORIGIN,RS can be collected directly from attributes of 8th col

1. ALLELEID=

2. CLNHGVS=

3. CLNSIG=

4. CLNVC=

5. ORIGIN=

6. RS=

iv. Gene_ID & Gene_Symbol can be collected from GENEINFO attribute in 8th column

1. GENEINFO=Gene_Symbol:Gene_ID

v. Consequence can be collected from MC attribute of 8th col

1. MC=SO:SO_ID|Consequence

vi. If any of the attribute isn’t available put ‘-’ in the result file

d. Expected o/p for the first 2 lines are

i. 1,861332,1019397,G,A,1003021,NC_000001.10:g.861332G>A,Uncertain

_significance,single_nucleotide_variant,1,1640863258,148398,SAMD11, missense_variant

ii. 1,865519,1125147,C,T,1110865,NC_000001.10:g.865519C>T,Likely_beni

gn,single_nucleotide_variant,1,-,148398,SAMD11,intron_variant

 

8. From the .csv file created in the above step, count the different type of origin (10th col)

a. Values of Origin col have the following meaning.

i. 0 - unknown;

ii. 1 - germline;

iii. 2 - somatic;

iv. 4 - inherited;

v. 8 - paternal;

vi. 16 - maternal;

vii. 32 - de-novo;

viii. 64 - biparental;

ix. 128 - uniparental;

x. 256 - not-tested;

xi. 512 - tested-inconclusive;

b. If you get number other than listed above, classify under ‘Others’

c. Make a data structure (dictionary) that has Origin type as key and the count of them as value

i. Expected o/p

'Others' => 95,

'de-novo' => 38,

'inherited' => 32,

'somatic' => 18,

'maternal' => 19,

'paternal' => 14,

 

'germline' => 6648,

'uniparental' => 6,

'unknown' => 145

d. Make a data structure of the same as mentioned in ( c ) into a json object. Display the results as a table using HTML

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

597 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

994 Answers

Hire Me
expert
Husnain SaeedComputer science

677 Answers

Hire Me
expert
Atharva PatilComputer science

539 Answers

Hire Me
April
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30