BOL: Related items

MetaPred2CS

Manisha Mishra — Fri, 03 Mar 2017 05:15:07 -0600

MetaPred2CS Web server is a meta-predictor based on Support Vector Machine (SVM) that combines 6 individual sequence based protein-protein interaction prediction methods to predict prokaryotic two-component system protein-protein interactions (PPIs). The methods implemented in MetaPred2CS are 2 co-evolutionary methods: in-silico two hybrid (i2h) and mirror tree (MT) methods and 4 genomics context based methods: phylogenetic profiling (PP), gene fusion (GF), gene neighbourhood (GN) and and gene operon methods (GO).

http://metapred2cs.ibers.aber.ac.uk/

Address of the bookmark: https://github.com/martinjvickers/MetaPred2CS

miniasm: very fast OLC-based de novo assembler for noisy long reads

Jit — Mon, 27 Nov 2017 07:58:49 -0600

Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream assemblers, miniasm does not have a consensus step. It simply concatenates pieces of read sequences to generate the final unitig sequences. Thus the per-base error rate is similar to the raw input reads.

So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are PacBio E. coli sample, ERS473430, ERS544009, ERS554120, ERS605484, ERS617393, ERS646601, ERS659581, ERS670327, ERS685285, ERS743109 and a deprecated PacBio E. coli data set. ONT data are acquired from the Loman Lab.

For a C. elegans PacBio data set (only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the HGAP3produces a 104Mb assembly with N50 1.61Mb. This dotter plot gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.

Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that minimap can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as MHAP and DALIGNER. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.

Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)

We start with an all against all comparison:

minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 > reads.paf.gz

Then we can assemble

miniasm -f reads.fq reads.paf.gz > reads.gfa

Convert GFA to FASTA:

awk '/^S/{print ">"$2"\n"$3}' reads.gfa | fold > reads.fa

And then count how many contigs:

grep ">" reads.fa | wc -l

# Download sample PacBio from the PBcR website
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz | tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
# Install minimap and miniasm (requiring gcc and zlib)
git clone https://github.com/lh3/minimap && (cd minimap && make)
git clone https://github.com/lh3/miniasm && (cd miniasm && make)
# Overlap
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 > reads.paf.gz
# Layout
miniasm/miniasm -f reads.fq reads.paf.gz > reads.gfa

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

Bioinformatics Faculty at BHARATHIDASAN UNIVERSITY

Sat, 26 Sep 2015 20:34:20 -0500

BHARATHIDASAN UNIVERSITY

(Reaccredited by NAAC with ‘A’ grade)

TIRUCHIRAPPALLI - 620 024

I N V I T E S

APPLICATIONS FOR FACULTY POSITIONS UNDER UGC XII PLAN CREATED POSTS ON CONTRACTUAL BASIS TILL 31.03.2017 IN THE FOLLOWING UNIVERSITY DEPARTMENTS. (Notification No. 31300 /H2/2015, Dt.: 18.09.2015)

ASSISTANT PROFESSOR

1. Bio-Informatics ONE (MBC)

2. Bio-Chemistry ONE G.T.(W)DW

Consolidated Pay of Rs.45,000/- p.m.

Qualification : As per UGC/AICTE/NCTE norms

Application along with other details including specialization can be downloaded from the University website www.bdu.ac.in

LAST DATE FOR RECEIPT OF FILLED IN APPLICATION IS 07.10.2015 BY 5.00 P.M.

More Info : www.bdu.ac.in/adv/UGC_XII_Plan_Contract_Positions.pdf

Reference-free prediction of rearrangement breakpoint reads

Neel — Thu, 08 Mar 2018 05:05:25 -0600

lideSort-BPR ( b reak p oint r eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing depth of 100×, it finds ∼88% of the breakpoints correctly with no false-positive reads. Moreover, evaluation on a real prostate cancer dataset shows that the proposed method predicts more fusion transcripts correctly than previous approaches, and yet produces fewer false-positive reads. To our knowledge, this is the first method to detect breakpoint reads without using a reference genome.

https://github.com/ewijaya/slidesort-bpr

Address of the bookmark: https://code.google.com/archive/p/slidesort-bpr/

R.A Bioinformatics at JNU, Delhi

Tue, 10 May 2016 01:50:38 -0500

R.A Jobs opportunity in Jawaharlal Nehru University (JNU) on purely temporary basis

Project Title : "Structural and functional characterization of serine biosynthetic pathway enzymes from Entamoeba histolytica"

No. of Post : 01

Qualification : Ph.D in any computational biology / bioinformatics

Desirable : 1. Experience with docking, simulations and structural biology with proof of publications is preferred. 2. National Eligibility Test cleared [CSIR/UGC] candidate is preferred.

Salary : According to CSIR rules
How to apply

The application on plain paper indicating name, date of birth/age, address, essential/technical/professional qualifications. experience, list of publications should reach The Prof. S. Gourinath, Principal Investigator, [Project Director], School of Life Sciences, Jawaharlal Nehru University, New Delhi-110067, on or before 23rd May 2016.

More at http://www.jnu.ac.in/Career/currentjobs.htm

TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads

Surabhi Chaudhary — Tue, 15 May 2018 02:53:11 -0500

TAndem REpeat ANalyzer -TAREAN – is a computational pipeline for unsupervised identification of satellite repeats from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.

How to use TAREAN:

Install a local instance of the pipeline using its source code available from bitbucket repository.
Use public Galaxy-based server at https://repeatexplorer-elixir.cerit-sc.cz/. The server is provided in frame of the Elixir CZ project and is maintained by CESNET and CERIT-SC. Simple registration is required to use this service.

Development of TAREAN was supported by ELIXIR CZ research infrastructure project (MEYS Grant No: LM2015047).

References

Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) – TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads. Nucleic Acids Res., doi:10.1093/nar/gkx257

Address of the bookmark: https://bitbucket.org/petrnovak/repex_tarean

Research Trainees recruitment in National Agri-Food Biotechnology Institute (NABI)

Sun, 29 Nov 2015 02:47:28 -0600

Research Trainees recruitment in National Agri-Food Biotechnology Institute (NABI)

Eligibility : Pursuing final year of M.Sc./M.Tech.

Subject category for training : I. Agricultural biotechnology II. Computational biology and bioinformatics III. Food Science & Technology IV. Nutrition Science & Technology

Duration of Training : 6 months (January to June 2016)

Selection Procedure : Through screening and selection based on merit, experience, and expression of interest submitted by candidates
How to apply

The last date of application to reach NABI latest by November 30, 2015 by 5:30 PM

More at http://www.nabi.res.in/Training.aspx

GenomeMapper: Simultaneous alignment of short reads against multiple genomes

Jit — Fri, 25 May 2018 09:29:44 -0500

GenomeMapper is a short read mapping tool designed for accurate read alignments. It quickly aligns millions of reads either with ungapped or gapped alignments. It can be used to align against multiple genomes simulanteously or against a single reference. If you are unsure which one is the appropriate GenomeMapper, you might want to use the latter https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2768987/

Address of the bookmark: http://1001genomes.org/software/genomemapper.html

M. D. University, Rohtak is looking for the post of Research Associate

Fri, 13 Nov 2015 02:56:48 -0600

M. D. University, Rohtak - Rohtak, Haryana
M. D. University, Rohtak is looking vacancies for the post of Research Associate

Project entitled: "Establish of Bioinformatics Facility for biology teaching through bioinformatics"

Name of post: Research Associate /Trainees

Number of post: 03

Educational Qualification and Experience: Candidates should have Ph D in relevant subjects with experience in handling computational biology resources and software

Selection mode: Walk in interview

How to apply?
Interested and eligible candidates may appear for a walk-in interview on 14th November 2015 at 11.00 am, in the office of Director, Centre for Bioinformatics along with CV and attested copies of all testimonials and additional qualifications.

Recruitment reference: http://www.mdurohtak.ac.in/pdf/career/adv_research_asso_dbt_bioinfo.pdf

ReMILO: reference assisted misassembly detection algorithm using short and long reads.

Jit — Fri, 06 Jul 2018 04:27:49 -0500

ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies.

Address of the bookmark: https://github.com/songc001/remilo