BOL: Related items

FQC Dashboard: Integrates FastQC results into a web-based, interactive, and extensible FASTQ quality control tool

Shruti Paniwala — Tue, 10 Nov 2020 01:30:22 -0600

FQC is software that facilitates quality control of FASTQ files by carrying out a QC protocol using FastQC, parsing results, and aggregating quality metrics into an interactive dashboard designed to richly summarize individual sequencing runs. The dashboard groups samples in dropdowns for navigation among the data sets, utilizes human-readable configuration files to manipulate the pages and tabs, and is extensible with CSV data.

Address of the bookmark: https://github.com/pnnl/fqc

ICGEB Bioinformatics RA/SRF/JRF Vacancies

Thu, 13 Nov 2014 13:39:30 -0600

Research Associate/JRF/SRF position, DBT Sponsored Bioinformatics Infrastructure Facility

Applicants should hold a PhD or a first class MSc/MTech degree in Bioinformatics of Biotechnology/Life Sciences; experience in using bioinformatics tools, working in Linux and knowledge of computer network administration.

Submit CV and letter of interest by email to: Dr. Dinesh Gupta atdinesh@icgeb.res.in

Mulan: MUltiple sequence Local AligNment and conservation visualization tool

Rahul Nayak — Thu, 20 Jul 2017 08:02:32 -0500

Mulan performs multiple (2 or more) sequence alignments with an efficient and rapid "full local" alignment strategy that ensures a recapitulation of evolutionary sequence rearrangements (such as inversions and reshuffling) in any of the species. It combines refine and tba tools to align either "draft" or "finished" quality sequences. Mulan provides a dynamic graphical interface to align and visualize conservation profiles for evolutionarily distant and closely related species.

Input formats, automated data upload from the UCSC Genome Browser, gene annotation, annotation of repetitive elements, and progress report were previously described in the zPicture instructions and we refer the users to these materials for more details. This introduction is mainly focused on some novel features unique to the Mulan.

Address of the bookmark: https://mulan.dcode.org/mulanInstructions.php

NIAB Molecular Biology/Bioinformatics Scientist/RA Openings

Fri, 12 Dec 2014 21:08:47 -0600

D. No. 1-121/1, 4th and 5th Floors, Axis Clinicals Building, Miyapur, Hyderabad, Telangana, India- 500 049

Email: admin@niab.org.in Telephones: +91 40 2304 9403 Telefax: +91 40 2304 2740
Advertisement No: 5/2014

About NIAB National Institute of Animal Biotechnology (NIAB), Hyderabad, an autonomous institute under the aegis of Department of Biotechnology, Government of India, is aimed to harness novel and emerging biotechnologies and create knowledge in the cutting edge areas for improving animal health and productivity.

Applications are invited for the following temporary research positions to work in ongoing DBTBBSRC sponsored research project entitled “Transcriptome Analysis in Indian buffalo and the Genetics of Innate Immunity” at the National Institute of Animal Biotechnology, Hyderabad.

(A) Project Scientist – Level B (One Position)

Emoluments: Rs. 15600 + GP Rs. 5400 + 30 % HRA p.m. (Total emoluments will be Rs. 49,770/-p.m. for the duration of the project)

Essential Qualification: Candidates having M.V.Sc. in Veterinary Microbiology / Veterinary Pathology / Veterinary Public Health / Ph.D. degree in Life Sciences, Biotechnology, Molecular Biology or any other related field from the recognized university are eligible to apply.

The candidate should have a good academic record and research experience as evidenced from published in standard referred journals / patents.

Desirable: Candidates having research experience in the area of tissue culture, genomics, Transcriptomics and Advanced Molecular Biology will be given preference.

Age Limit: Not exceeding 30 years as on last date of the submission of the application.

(B) Research Associate in Bioinformatics (One position)

Fellowship: Rs. 22,000 + 30 % HRA

Essential Qualification: Candidates having Ph.D. degree or M.Tech. with three years of
experience in Bioinformatics, Computational Biology, Biotechnology, Life Sciences or any other related field are eligible to apply.

Desirable: Candidate having research experience in the area of next generation sequencing (NGS) data analysis, Genome wide association studies, Genomic selection, advance genomic data analysis etc., will be given preference. The candidate should have a good academic record and research experience as evidenced from published papers in standard journals / patents.

Age Limit: Not exceeding 30 years as on last date of the submission of the application.

Project Duration: The duration of the project is Three years and the positions are co- terminus with the duration of the project. (Initial appointment will be for one year and further extension will be granted based on annual review).

Mode of submission of application: Only online applications are to be submitted through
www.niab.org.in on or before 08 December, 2014. Link for online submission of applications will be available from 10 November 2014.

Advertisement: www.niab.org.in/Notifications/Advt_5_2014/Advt_5_2014.pdf

ACANA: An accurate and consistent alignment tool for DNA sequences

Jit — Wed, 06 Dec 2017 09:45:29 -0600

ACANA is an accurate and consistent alignment tool for DNA sequences. ACANA is specifically designed for aligning sequences that share only some moderately conserved regions and/or have a high frequency of long insertions or deletions. It attempts to combine the best of local and global alignments algorithms in searching for evolutionarily related regions of sequences in order to achieve the best alignment. ACANA is also robust to the small changes of alignment parameters, particularly the gap extension score. As an accurate alignment tool, ACANA is particularly useful in comparative sequence analysis for identifying conserved functional regulatory elements.

Address of the bookmark: https://www.niehs.nih.gov/research/resources/software/biostatistics/acana/index.cfm

BIC-PGI Bioinformatics Project Dissertation Program

Fri, 12 Dec 2014 21:17:30 -0600

Biomedical Informatics Centre, PGIMER, Chandigarh invites application for a project dissertation program for students who have completed their first year of M.Sc. in Bioinformatics.

This is an exciting opportunity for Master's students to train in modern methods in Bioinformatics. The duration of the training will be four to six months, starting from January 2015.

Education: Pursuing M.Sc. Bioinformatics

Essential: Post graduate applicants should have completed their first year and should be in the third semester or first half of the second year.

Only students who are willing to spend a minimum period of 4 months to a maximum of six months, without any break, would be eligible for the program.

How to Apply: Candidates interested in the above project dissertation program should apply online.

Send your CV, Scanned copy of letter of recommendation from Head of Institution along with Registration form in the given format should be sent to: info@bicpgi.org

Please mention clearly “Project dissertation & your Name” in the Subject.

The last date for application is December 31, 2014

Note: Selected candidates may please note that the program is free of cost and would not provide any financial aid for transport and stay.

Name of the selected candidates would be posted on the centre website by December 31, 2014. Incomplete applications will be rejected.

For more information visit our website: http://www.bic-pgi.org/project_dissertation.pdf

SMASH: An alignment-free tool to find and visualise rearrangements between pairs of DNA sequences

Jit — Thu, 21 Dec 2017 08:26:57 -0600

SMASH is a completely alignment-free method to find and visualise rearrangements between pairs of DNA sequences. The detection is based on relative compression, namely using a FCM, also known as Markov model, of high context order (typically 20). The method has been approached with a tool (also called SMASH). For visualization, SMASH outputs a SVG image, with an ideogram output architecture, where the patterns are represented with several HSV values (only value varies). The following image, illustrating the information maps between human and chimpanzee for the several chromosomes, depicts an example:

Address of the bookmark: https://github.com/pratas/smash

Vital-IT

Abhi — Thu, 18 Dec 2014 10:46:59 -0600

Vital-IT is a bioinformatics competence center that supports and collaborates with life scientists in Switzerland and beyond. The multi-disciplinary team provides expertise, training and maintains a high-performance computing (HPC) and storage infrastructure, so as to help develop, maintain and extend life science and medical research (activities).

Address of the bookmark: http://www.vital-it.ch/

Heap: a highly sensitive and accurate SNP detection tool for low-coverage high-throughput sequencing data

Jit — Thu, 19 Apr 2018 08:06:03 -0500

Heap, that enables robustly sensitive and accurate calling of SNPs, particularly with a low coverage NGS data, which must be aligned to the reference genome sequences in advance. To reduce false positive SNPs, Heap determines genotypes and calls SNPs at each site except for sites at the both end of reads or containing a minor allele supported by only one read. Performance comparison with existing tools showed that Heap achieved the highest F-scores with low coverage (7X) restriction-site associated DNA sequencing reads of sorghum and rice individuals. This will facilitate cost-effective GWAS and GP studies in this NGS era. Code and documentation of Heap are freely available from https://github.com/meiji-bioinf/heap and our web site (http://bioinf.mind.meiji.ac.jp/lab/en/tools.html).

Address of the bookmark: https://github.com/meiji-bioinf/heap

BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data

Jit — Thu, 31 May 2018 09:35:23 -0500

BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes. The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC. https://github.com/lh3/bfc

Address of the bookmark: https://github.com/lh3/bfc