Sri Venkateswara College (University of Delhi)

New Delhi- 110021

1. Junior Research Fellow (1 Post)

Applications are invited for the post of Junior Research Fellow (JRF) under DST funded project which is purely temporary and is strictly for project duration only.

Title of project

No. of post

Remuneration (Rs.)

“Computational assisted Design and Synthesis of Novel Antimalarial Agents Embodying Structural Diversity Suitable for Protease Inhibitors”

(One)

Fellowship and HRA as per DST guidelines

Qualification

Post Graduate Degree in Basic Science (M.Sc./M.Tech in Bioinformatics/Biophysics) from a recognized University in India or abroad with at least 55% marks with NET qualification or Graduate Degree in Professional Course with NET Qualification or Post Graduate Degree in Professional Course.

Desirable

Fair knowledge of Computer Aided Drug Designing (CADD), Protein Structure modeling, molecular docking, and simulations are preferable.

2. Traineeship (1 Post)

Applications are invited for the position of traineeship in DBT-BTISnet funded Bioinformatics Infrastructure Facility (BIF) to carry out project work in the area of Bioinformatics.

Qualification

Applicant should be possess PG degree/PG diploma in Bioinformatics for traineeship. The traineeship is awarded for a period of six months from the date of joining and is not extendable. The selected candidates are entitled to receive a stipend of Rs. 8000/- per month (consolidate) for a period of 6 months.

=====================================================================

3. Studentship (1 Post)

Applications are invited for the position of Studentship in DBT-BTISnet funded Bioinformatics Infrastructure Facility (BIF) to carry out project work in the area of Bioinformatics.

Qualification

Candidates pursuing the Final Year of Post Graduate Degree in Basic Science (M.Sc.) or Post Graduate/ Graduate Degree in Professional Course (M.Tech/B.Tech) in Bioinformatics from a recognized University in India or abroad. The selected candidates are entitled to receive a stipend of Rs. 8000/- per month (consolidate) for a period of 6 months.

How to Apply?

Applicants are required to send applications on plain paper, stating the name, address, date of birth, educational qualification, experience and Institute, along with attested photocopies of mark sheets and certificates etc. by September 20, 2016 to:

The Coordinator

Bioinformatics Center, Sri Venkateswara College

Benito Juarez Road, Dhaula Kuan, New Delhi- 110021

Applications may also be sent by email to contact@bic-svc.ac.in. Strictly mention "Application for JRF, Traineeship or Studentship" in the subject line as the case may be.

Short listed candidates will be called for an interview. Canvassing in any form will be a disqualification. No TA/DA will be paid either for attending the interview or joining the post.

For more details visit our lab webpage: http://www.bic-svc.ac.in

https://nxrepair.readthedocs.io/en/latest/tutorial.html

nxrepair aligned_matepairs.bam assemblyfasta.fasta error_locations.csv new_fasta.fasta

Address of the bookmark: https://github.com/rebeccaroisin/nxrepair

The Rearrangement Overview page describes the one or more breakpoints which make up a structural variant. A breakpoint is defined as a region or point where the sample sequence has altered from the reference sequence. Minimum interpretation is made of this data. One variant event can consist of one or multiple breakpoints. The Syntax (shown above the table) gives a detailed description of the variant and its location  (e.g. chr11:g.36585230_76606619del, a deletion of roughly 40Mb on chromosome 11). Syntax is based on HGVS mutation nomenclature recommendations [http://www.hgvs.org/rec.html]. 

http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview

Address of the bookmark: http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview

https://github.com/mvollger/SDA

Address of the bookmark: https://www.nature.com/articles/s41592-018-0236-3

Address of the bookmark: https://sourceforge.net/projects/contiguator/

Beagle version 4.1 has a more accurate genotype phasing algorithm and a very fast and accurate genotype imputation algorithm. Version 4.1 also has several changes to the command line arguments which are described in the release notes. The "ped" argument has no effect in version 4.1. If your data contains nuclear families and you want to model the parent-offspring relationships when phasing genotypes, please use version 4.0.

If you use Beagle 4.1 in a published analysis, please report the program version and cite the appropriate article.

The citation for Beagle's phasing algorithm is:

S R Browning and B L Browning (2007) Rapid and accurate haplotype phasing and missing data inference for whole genome association studies by use of localized haplotype clustering. Am J Hum Genet 81:1084-1097.doi:10.1086/521987

The citation for Beagle's genotype imputation algorithm is:

B L Browning and S R Browning (2016). Genotype imputation with millions of reference samples. Am J Hum Genet 98:116-126.doi:10.1016/j.ajhg.2015.11.020

The citation for Beagle's IBD detection algorithm is:

B L Browning and S R Browning (2013). Improving the accuracy and efficiency of identity-by-descent detection in population data. Genetics 194(2):459-71.doi:10.1534/genetics.113.150029

Address of the bookmark: http://faculty.washington.edu/browning/beagle/beagle.html

Address of the bookmark: http://www.niehs.nih.gov/research/resources/software/biostatistics/art/

Address of the bookmark: http://rgraphgallery.blogspot.be/

Randomness and probability are two differnet concepts: probaility is a measure (according to measure theory) which measures the randomness. Randomness is the object to be measured by probability. For example, probability is a mapping from randomness to the real number between 0 and 1. The similar examples are that the entropy measures the uncertanity; product of length and width measures the area of rectangle etc.

Please see “A mathematical theory of ability measure” by N. Kong ets for more examples to answer this question.

We present methods for the identification of protein-coding genes based on their patterns of nucleotide conservation across related species. We observed the pressure to conserve the reading frame of functional proteins and developed a test for gene identification with high sensitivity and specificity. We used this test to revisit the genome of S. cerevisiae, reducing the overall gene count by 500 genes (10% of previously annotated genes) and refining the gene structure of hundreds of genes. We present novel methods for the systematic de novo identification of regulatory motifs. The methods do not rely on previous knowledge of gene function and in that way differ from the current literature on computational motif discovery. Based on the genome-wide conservation patterns of known motifs, we developed three conservation criteria that we used to discover novel motifs. We used an enumeration approach to select strongly conserved motif cores, which we extended and collapsed into a small number of candidate regulatory motifs. These include most previously known regulatory motifs as well as several noteworthy novel motifs. The majority of discovered motifs are enriched in functionally related genes, allowing us to infer a candidate function for novel motifs.

Our results demonstrate the power of comparative genomics to further our understanding of any species. Our methods are validated by the extensive experimental knowledge in yeast, and will be invaluable in the study of complex genomes like that of human.

Address of the bookmark: http://web.mit.edu/manoli/www/publications/Kellis_JCB_04.pdf