BOL: Related items

ASSISTANT PROFESSOR Bioinformatics at ALAGAPPA UNIVERSITY

Thu, 03 Dec 2015 23:30:43 -0600

ALAGAPPA UNIVERSITY
Recruitment and Sarkari Naukri for the Post of ASSISTANT PROFESSOR Bioinformatics
Job Description UGC scale of pay is applicable. For eligibility qualifications and other norms, please refer to the ?Instructions to the Candidates? available with the application forms which can be had on payment of Rs.520/- inclusive of Rs.20/- for postage. For SC/ST, Rs.320/- inclusive of Rs.20/- for postage on enclosure of a copy of the community certificate. Payment is to be made by means of Demand Draft drawn on any nationalized bank in favour of ?The Registrar, Alagappa University? payable at Karaikudi. Candidates can also download the application form and instructions to the candidates from httpwww.alagappauniversity.ac Filled-in application should reach on or before 19.10.2015
Salary for Job : Rs.15600-39100+AGP Rs.6000
Education : Good academic record with at least 55 marks (or an equivalent grade in a point scale wherever grading system is followed) at the Masters Degree level in a relevant subject from an Indian University, or an equivalent degree from an accredited foreign university. Besides fulfilling the above qualifications, the candidate must have cleared the National Eligibility Test (NET) conducted by the UGC, CSIR or similar test accredited by the UGC like SLET/SET.Notwithstanding anything contained in sub-clauses (i) and (ii) above, the candidates, who are, or have been awarded a Ph.D. degree in accordance with the University Grants Commission (Minimum Standards and Procedure for Award of Ph.D. Degree) Regulations 2009, shall be exempted from the requirement of the minimum eligibility condition of NET/SLET/SET for recruitment and appointment of Assistant Professor or equivalent positions in Universities/Colleges/Institutions.
Number of Vacancies : 02
Naukri Location : Other City(s) in Tamil Nadu
Address : KARAIKUDI ? 630 003
Last Date to Apply : 2015-12-04
Apply Process : written test/interview

svelter

Jitendra Prajapati — Mon, 29 Feb 2016 17:33:15 -0600

This software is designed to identify both simple and complex rearrangements from paired-end sequencing data. Users could ran it easily by just alling SVelter.py with proper parameters. It's also possible to ran it on multiple cores by calling different sub-functions separately.

More at https://github.com/mills-lab/svelter/

Address of the bookmark: https://github.com/mills-lab/svelter/

Trimmomatic: A flexible read trimming tool for Illumina NGS data

Jit — Fri, 15 Apr 2016 05:58:53 -0500

Paired End:

java -jar trimmomatic-0.35.jar PE -phred33 input_forward.fq.gz input_reverse.fq.gz output_forward_paired.fq.gz output_forward_unpaired.fq.gz output_reverse_paired.fq.gz output_reverse_unpaired.fq.gz ILLUMINACLIP:TruSeq3-PE.fa:2:30:10 LEADING:3 TRAILING:3 SLIDINGWINDOW:4:15 MINLEN:36

This will perform the following:

Remove adapters (ILLUMINACLIP:TruSeq3-PE.fa:2:30:10)
Remove leading low quality or N bases (below quality 3) (LEADING:3)
Remove trailing low quality or N bases (below quality 3) (TRAILING:3)
Scan the read with a 4-base wide sliding window, cutting when the average quality per base drops below 15 (SLIDINGWINDOW:4:15)
Drop reads below the 36 bases long (MINLEN:36)

More at http://www.usadellab.org/cms/?page=trimmomatic

Address of the bookmark: http://www.usadellab.org/cms/?page=trimmomatic

Venn Diagrams on R Studio

Jitendra Prajapati — Mon, 25 Apr 2016 16:22:28 -0500

First step: Install & load “VennDiagram” package.

# install.packages('VennDiagram')
library(VennDiagram)

Second step: Load data

Add filepath if “catdoge.csv” is not in working-directory.

d <- read.csv("catdoge.csv")

Address of the bookmark: http://rstudio-pubs-static.s3.amazonaws.com/13301_6641d73cfac741a59c0a851feb99e98b.html

Smash: An alignment-free method to find and visualise rearrangements between pairs of DNA sequences

Jit — Tue, 26 Apr 2016 12:18:49 -0500

Smash is a completely alignment-free method/tool to find and visualise genomic rearrangements. The detection is based on conditional exclusive compression, namely using a FCM (Markov model), of high context order (typically 20). For visualisation, Smash outputs a SVG image, with an ideogramoutput architecture, where the patterns are represented with several HSV values (only value varies). The method can perform both in small- and large-scale. Nevertheless is more directed to large-scale since that the main aim of the research is to know where the large-scale [chromosomal by chromosome] of several primates was equal/different, having at a glance a map of the entire genomes.

Address of the bookmark: http://bioinformatics.ua.pt/software/smash/

segemehl

Anjana — Tue, 10 May 2016 08:10:15 -0500

segemehl is a software to map short sequencer reads to reference genomes. Unlike other methods, segemehl is able to detect not only mismatches but also insertions and deletions. Furthermore, segemehl is not limited to a specific read length and is able to map primer- or polyadenylation contaminated reads correctly. segemehl implements a matching strategy based on enhanced suffix arrays (ESA).

More at http://www.bioinf.uni-leipzig.de/Software/segemehl/

Manual http://www.bioinf.uni-leipzig.de/Software/segemehl/segemehl_manual_0_1_7.pdf

Address of the bookmark: http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html

AccNET

Jitendra Narayan — Fri, 07 Oct 2016 05:22:11 -0500

AccNET is a Perl application that presents a new way to study the accessory genome of a given set of organisms. Using the proteomes of these organisms, AccNET create a bipartite network compatible with common network analysis platforms. AccNET collects phylogenetic and functional information in a network improving the analysis capability. Networks offer a new perspective of organism organization through elements acquired by horizontal gene transfers and not constricted by hierarchical structures.

More at https://www.youtube.com/watch?v=vdGuy1GAJrQ

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

MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping

Neel — Fri, 20 May 2016 18:53:49 -0500

MOSAIK is a stable, sensitive and open-source program for mapping second and third-generation sequencing reads to a reference genome. Uniquely among current mapping tools, MOSAIK can align reads generated by all the major sequencing technologies, including Illumina, Applied Biosystems SOLiD, Roche 454, Ion Torrent and Pacific BioSciences SMRT. Indeed, MOSAIK was the only aligner to provide consistent mappings for all the generated data (sequencing technologies, low-coverage and exome) in the 1000 Genomes Project. To provide highly accurate alignments, MOSAIK employs a hash clustering strategy coupled with the Smith-Waterman algorithm. This method is well-suited to capture mismatches as well as short insertions and deletions. To support the growing interest in larger structural variant (SV) discovery, MOSAIK provides explicit support for handling known-sequence SVs, e.g. mobile element insertions (MEIs) as well as generating outputs tailored to aid in SV discovery.

Address of the bookmark: http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0090581

Stand-alone programs for Bioinformatician

Radha Agarkar — Sat, 21 May 2016 22:50:15 -0500

This directory contains applications for stand-alone use, built specifically for a Linux 64-bit machine.

For help on the bigBed and bigWig applications see:
http://genome.ucsc.edu/goldenPath/help/bigBed.html
http://genome.ucsc.edu/goldenPath/help/bigWig.html

View the file 'FOOTER' to see the usage statement for each of the applications.

Address of the bookmark: http://hgdownload.cse.ucsc.edu/admin/exe/linux.x86_64/

CNIDARIA: fast, reference-free phylogenomic clustering

Shruti Paniwala — Thu, 16 Jun 2016 17:55:17 -0500

Motivation: Identification of biological specimens is a major requirement for a range of applications. Reference-free methods analyse unprocessed sequencing data without relying on prior knowledge, but these do not scale to arbitrarily large genomes and arbitrarily large phylogenetic distances.

Results: We present Cnidaria, a practical tool for clustering genomic and transcriptomic data with no limitation on ge-nome size or phylogenetic distances. We successfully simultaneously clustered 169 genomic and transcriptomic datasets from 4 kingdoms, achieving 100% accuracy at supra-species level and 78% accuracy for species level.

Availability and Implementation: Cnidaria is written in C++ and Python and is available at http://www.ab.wur.nl/cnidaria.

Contact: Saulo Aflitos - sauloal@gmail.com

Supplementary information: Supplementary data are available at Bioinformatics online.

Address of the bookmark: https://github.com/sauloal/cnidaria/wiki