BOL: Related items

KAU Thrissur Biotech/Bioinformatics RA/SRF/JRF/Trainee/Studentships

Fri, 26 Sep 2014 20:07:28 -0500

Applications are invited from eligible candidates for the following posts at Bioinformatics Centre (DIC), IT- BT Complex, College of Horticulture, Kerala Agricultural University, Vellanikkara, Thrissur.

1. Research Associate
Emoluments*: 14880/- + HRA
Qualification needed: Ph.D/M.Sc in Bioinformatics or Ph.D/M.Sc in Agriculture or Biotechnology with advanced Diploma in Bioinformatics
Desirable: 2 year experience in Bioinformatics.

2 Senior Research Fellow
Emoluments*: 10230/-
Qualification needed: M.Sc/ M.tech in Bioinformatics or M.Sc in Agriculture/ Biotechnology with Diploma in Bioinformatics.
Desirable: One year experience in Bioinformatics

3 Junior Research Fellow
Emoluments*: 9300/-
Qualification needed: M.Sc/ M.tech in Bioinformatics or M.Sc in Agriculture/Biotechnology/Plant Sciences with Diploma in Bioinformatics.

4 .Trainee/Studentship Bioinformatics
Emoluments*: 5000/-
Qualification needed: M.Sc in Bioinformatics with good knowledge of Bioinformatics softwares and tools.

5 Trainee/ Studentship Biotechnology
Emoluments*: 5000/-
Qualification needed: M.Sc in Biotechnology, with working knowledge in tissue culture, molecular markers and cloning of genes.

Candidates with the required qualifications and experience may give an application in the prescribed format with attested copies of certificates to prove eligibility on or before 30th November 2014. The applications are to be addressed to The Associate Dean, College of Horticulture and send to "Professor & Coordinator, Bioinformatics Centre (DIC), IT-BT Complex, Kerala Agricultural University, Vellanikkara, Thrissur, Kerala 680 656”. The envelope may be superscribed “Application for the post at Bioinformatics Centre”.

*Emoluments are likely to be revised in 2014-2015

More at http://www.kaubic.in/downloads/Notification_bic.pdf
http://www.kaubic.in/downloads/Application%20form.pdf

Cerulean: A hybrid assembly using high throughput short and long reads

Rahul Nayak — Tue, 05 Jun 2018 10:10:15 -0500

Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads. Cerulean v0.1 has been implemented with bacterial genomes in mind. The method is fully described in Deshpande, V., Fung, E. D., Pham, S., & Bafna, V. (2013). Cerulean: A hybrid assembly using high throughput short and long reads. arXiv preprint arXiv:1307.7933. http://arxiv.org/abs/1307.7933

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

FACULTY POSITION at NATIONAL INSTITUTE OF TECHNOLOGY, ROURKELA

Sun, 05 Oct 2014 15:45:13 -0500

NIT, Rourkela, an institute of national importance under Ministry of HRD, Govt. of India invites applications from Indian nationals possessing excellent academic background along with commitment to quality teaching and research for faculty positions at the level of Professor, Associate Professor and Assistant Professor in most branches of Engineering, Science, Management and Humanities as per following table:-

1 Asst. Professor (on Pre-Ph.D. Contract)

2 Asst. Professor (on Contract)

3 Asst. Professor

4 Associate Professor

5 Professor

Life Sciences:-

i)Biochemistry and Molecular Biology; ii)Cell and Developmental Biology; iii)Immunology and Molecular Medicine; (iv) Microbiology and Ecology (v)Bioinformatics Group; vi)Biophysical Sciences

HOW TO APPLY:-

a. Candidates willing to apply for one or more posts are requested to apply online at “http://www.nitrkl.ac.in/ JOBS & TENDERS /Faculty Position” .
b. Persons employed in Government and Semi-Government organizations may apply directly against the standing advertisement. For this the application should be completed online. The printout of the application generated online should be submitted through employer if shortlisted for interview.
c. The online application can be filled in multiple sessions.
d. Candidates are required to check the Institute website from time to time for latest information, application status call for interview, change of dates and final results.
e. Applications shall be received online only. Please do not send application or CV against this advertisement by email or letter mail.

More Info: http://nitrkl.ac.in/Jobs_Tenders/1FacultyPosition/Default.aspx

JBrowse: Embeddable genome browser built completely with JavaScript and HTML5

Jit — Fri, 29 Jun 2018 09:19:56 -0500

JBrowse is a fast, embeddable genome browser built completely with JavaScript and HTML5, with optional run-once data formatting tools written in Perl. Headline Features: Fast, smooth scrolling and zooming. Explore your genome with unparalleled speed. Scales easily to multi-gigabase genomes and deep-coverage sequencing. Quickly open and view data files on your computer without uploading them to any server. Supports GFF3, BED, FASTA, Wiggle, BigWig, BAM, VCF (with either .tbi or .idx index), REST, and more. BAM, BigBed, BigWig, and VCF data are displayed directly from chunks of the compressed binary files, no conversion needed. Includes an optional “faceted” track selector (see demo) suitable for large installations with thousands of tracks. Very light server resource requirements. In fact, JBrowse has no back-end server code, just tools for formatting data files to be read directly over HTTP. Serve huge datasets from a single low-cost cloud instance. Can run as a stand-alone app on OSX and Windows using the Electron platform Highly extensible plugin architecture, with a large plugin registry of existing examples here https://gmod.github.io/jbrowse-registry https://jbrowse.org/

Address of the bookmark: https://github.com/GMOD/jbrowse

Software developed in pevsner lab

Robert M Willioms — Mon, 06 Oct 2014 12:41:26 -0500

DRAGON: Database Referencing of Array Genes Online

SNOMAD: Standardization and Normalization of Microarray Data

SNPduo: SNP Analysis Between Two Individuals

SNPtrio: Analyzing and Visualizing and Inheritance Patterns in Trios

SNPscan: Data Analysis and Visualization of SNP Data

pediSNP: Analyze SNP Data From a Pedigree of Two Generations

kcoeff: Calculate Cotterman Coefficients of SNP Genotype Data

triPOD: Detects chromosomal abnormalities in parent-child trio-based microarray data

Address of the bookmark: http://pevsnerlab.kennedykrieger.org/php/?q=software

Hercules: a profile HMM-based hybrid error correction algorithm for long reads

Jit — Mon, 20 Aug 2018 14:14:11 -0500

Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability:

Hercules source code is available at https://github.com/BilkentCompGen/Hercules

Address of the bookmark: https://github.com/BilkentCompGen/Hercules

Research Fellows at CSIR - Institute of Himalayan Bioresource Technology, Palampur, Himachal Pradesh

Tue, 19 May 2015 07:17:32 -0500

CSIR - Institute of Himalayan Bioresource Technology 2 vacancies of Project Fellow

Name of the Post: Project Fellow

No. of the Post: 02 Two

Salary: Rs. 12000/- per month or Rs. 14000/- per month

Age Limit: Max. 28 years as on 10.06.2015 and relaxation as per rules

Required Job Profile:

Candidate must possess first class B.Tech. in bioinformatics or computational biology OR M.Sc. in bioinformatics or computational biology with fifty five percent marks OR M.Tech. in bioinformatics or computational biology with fifty five percent marks.

How to apply:

Eligible and interested candidates should need to appear for walk-in interview on 10.06.2015 at 9:00 am at the above mentioned address.

Refer to http://www.ihbt.res.in/recruit/AdvtNo7_2015.pdf

LoRMA: A tool for correcting sequencing errors in long reads

Abhimanyu Singh — Thu, 06 Sep 2018 16:21:01 -0500

An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of k-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75×, the throughput of the new method is at least 20% higher.

conda install -c atgc-montpellier lorma

Address of the bookmark: https://gite.lirmm.fr/lorma/lorma-releases/wikis/home

Big genomic data on Google Cloud Platform

Fri, 17 Oct 2014 02:16:00 -0500

As the cost of DNA sequencing has dropped, the volume of data produced has risen into the petabytes. Google is working with the genomics community to define a standard API for working with big genomic data sets in the cloud. Building on Google Cloud Platform, we show how to store, process, explore and share genomic data using technologies like BigQuery, AppEngine MapReduce, R and more.

Rainbow: an integrated tool for efficient clustering and assembling RAD-seq reads

Rahul Nayak — Fri, 19 Oct 2018 08:23:42 -0500

Rainbow is developed to provide an ultra-fast and memory-efficient solution to clustering and assembling short reads produced by RAD-seq. First, Rainbow clusters reads using a spaced seed method. Then, Rainbow implements a heterozygote calling like strategy to divide potential groups into haplotypes in a top–down manner. And along a guided tree, it iteratively merges sibling leaves in a bottom–up manner if they are similar enough. Here, the similarity is defined by comparing the 2nd reads of a RAD segment. This approach tries to collapse heterozygote while discriminate repetitive sequences. At last, Rainbow uses a greedy algorithm to locally assemble merged reads into contigs. Rainbow not only outputs the optimal but also suboptimal assembly results. Based on simulation and a real guppy RAD-seq data, we show that Rainbow is more competent than the other tools in dealing with RAD-seq data

Address of the bookmark: https://sourceforge.net/projects/bio-rainbow/files/