BOL: Related items

Genome Origami

Jitendra Narayan — Fri, 12 Dec 2014 22:48:17 -0600

There are several interesting factoid about our genomes, one of them is their folding. If we stretched out the DNA in a single cell, which is only a few millionths of an inch wide, it would span more than six feet. In other word, the size of six feet DNA fold themself to fit in a few millionths of an inch wide space. These DNA folding is a dynamic process that changes over time (!!). Researchers around the world have been trying to understand how DNA folds itself up so efficiently, and a recent post on the NIH Director’s Blog highlights new research illustrating how the human genome folds inside the cell’s nucleus, as well as how DNA folding affects gene regulation. The research team created this delightful video that demonstrates the principles involved using origami art.

http://bioinformaticsonline.com/videolist/watch/19555/a-3d-map-of-the-human-genome

Researchers have been working to determine how cells regulate gene expression for nearly as long as we’ve known about DNA. How, for example, do nerve cells know to turn off only nerve cell genes and turn off bone cell genes? DNA folding loops are part of the answer. This research team, which published their findings in a paper in Cell http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4 , found that the number of loops is much lower than expected. There are only 10,000 loops instead of the predicted millions, and they form on/off switches in DNA.

More at http://www.eurekalert.org/pub_releases/2014-12/ru-3mr121114.php

Reference http://www.cell.com/cell/abstract/S0092-8674%2814%2901497-4

wtdbg2: A fuzzy Bruijn graph approach to long noisy reads assembly

BioStar — Mon, 04 Feb 2019 04:53:47 -0600

Wtdbg2 is a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output.

./wtdbg2 -x rs -g 4.6m -t 16 -i reads.fa.gz -fo prefix
./wtpoa-cns -t 16 -i prefix.ctg.lay.gz -fo prefix.ctg.fa

Address of the bookmark: https://github.com/ruanjue/wtdbg2

WALK – IN – INTERVIEW @ Agricultural Knowledge Management Unit Indian Agricultural Research Institute, New Delhi-110012

Fri, 12 Dec 2014 21:33:02 -0600

Walk-in-interview for the following temporary positions will be conducted on 20th December 2014 (between 10:00 AM to 01:00 PM) at Agricultural Knowledge Management Unit, A0 block (Ground Floor), LBS Building, Indian Agricultural Research Institute, New Delhi-110012:

1 Dr. A.K.Mishra Coordinator & PI (BTISnet)

Traineeship (two) for one year

Rs. 5000/- (consolidated)

M.Sc. (Bioinformatics) with 60 % marks from a recognized University

20-12-2014 (10:00 AM -11:00 AM)

Studentship (four) for one year

Rs. 2500/- (consolidated)

Final year M.Sc./ M.Tech (Bioinformatics) Students from a recognized University

20-12-2014 (11:00 AM- 1:00 PM)

The positions are purely temporary and co-terminus with the DBT Programme. Eligible candidates are requested to submit the application form in the prescribed format along with original certificates/ documents (Degree, Marks sheets, Work experience, if any) at the time of interview. No TA/DA will be paid. Maximum age limit is 28 years for all positions. Age relaxation of 5 yrs for SC/ST and woman candidates and 3 years for OBC candidates will be given. Canvassing in any form invites disqualification.

Advertisement: http://www.iari.res.in/files/BIC-08122014-20141208-172344.pdf

FastGT: an alignment-free method for calling common SNVs directly from raw sequencing reads

Jit — Tue, 28 Jan 2020 03:27:33 -0600

FastGT is a program package for whole-genome genotyping of genome variants directly from raw sequencing reads. It is written in C and runs in Linux. FastGT uses a list of variant-specific k-mer pairs that are unique in human genome, counts the frequency of k-mers in sequencing data and predicts the genotype. All this takes less than 1 hour on average low-cost Linux server.

http://bioinfo.ut.ee/FastGT/

https://github.com/bioinfo-ut/GenomeTester4/

Address of the bookmark: http://bioinfo.ut.ee/FastGT/

Google Genomics

Tenzin Paul — Thu, 18 Dec 2014 11:05:42 -0600

Explore genetic variation interactively. Compare entire cohorts in seconds with SQL-like queries. Compute transition/transversion ratios, genome-wide association, allelic frequency and more.
Process big genomic data easily. Run batch analyses like principal component analysis and Hardy-Weinberg equilibrium on as many samples as you like, in minutes or hours, with just a little code.
Use Google's infrastructure and big data expertise. Store one genome or a million using Google Genomics and take advantage of the same infrastructure that powers Search, Maps, YouTube, Gmail and Drive.
Support emerging global standards. Google Genomics is implementing the API defined by the Global Alliance for Genomics and Health for visualization, analysis and more. Compliant software can access Google Genomics, local servers, or any other implementation.

Address of the bookmark: https://cloud.google.com/genomics/

Deepbinner: a signal-level demultiplexer for Oxford Nanopore reads

Jit — Mon, 10 Feb 2020 02:45:53 -0600

Deepbinner is a tool for demultiplexing barcoded Oxford Nanopore sequencing reads. It does this with a deep convolutional neural network classifier, using many of the architectural advances that have proven successful in image classification. Unlike other demultiplexers (e.g. Albacore and Porechop), Deepbinner identifies barcodes from the raw signal (a.k.a. squiggle) which gives it greater sensitivity and fewer unclassified reads.

Address of the bookmark: https://github.com/rrwick/Deepbinner

Studentship at Nagaland University

Tue, 16 Dec 2014 01:35:00 -0600

Nagaland University
(A Central University Estd. By the Act of Parliament No. 35 of 1989)
Lumami 798 627, Nagaland
DBT Sponsored ‘Bioinformatics Infrastructure Facility’ Centre

Applications in plain paper are invited for the posts of (1) Traineeship (2 Nos.) and (2) Studentship – (2 Nos.) in the DBT funded-Bioinformatics Infrastructure Facility (BIF), Nagaland University, Lumami-798627, Nagaland. Details are given below. Interested candidates may submit the application along with self attested copies of certificates in support of the candidature to Prof. Chitta Ranjan Deb, Coordinator or Dr. L. N. Kakati, Deputy Coordinator, BIF Centre, Nagaland University, Lumami-798627, Nagaland on or before 15th January 2015.

The scanned application with relevant documents may be sent by email attachment to bifnulumami@gmail.com. Shortlisted candidates will be informed by email if called for interview. No TA/DA is admissible for attending the interview.

Traineeship (Two nos.)

Post Graduate degree in any branch of Life Sciences from UGC recognized Universities

Knowledge of computers and bioinformatics

Rs.8000/- p.m. fixed.

6 months

Studentship (Two nos.)

Pursuing Post Graduate degree in any branch of Life Sciences from UGC recognized Universities

Knowledge of computers and bioinformatics

Rs.8000/- p.m. fixed.

6 months

Terms and Conditions:

i) Applicants need to produce all original documents if call for interview.
ii) The posts are purely temporary and the appointment does not confer any entitlement or right over the job and will not be considered as formal service.
iii) No TA & DA will be paid for appearing in the walk-in-interview.
iv) The stipend/salary amount is subject to the sanction of DBT, New Delhi.

Advertisement: http://www.nagauniv.org.in/files/BIF%20Advt.pdf

Filtlong: quality filtering tool for long reads

Radha Agarkar — Wed, 13 May 2020 10:23:55 -0500

Filtlong is a tool for filtering long reads by quality. It can take a set of long reads and produce a smaller, better subset. It uses both read length (longer is better) and read identity (higher is better) when choosing which reads pass the filter.

Filtlong builds into a stand-alone executable:

git clone https://github.com/rrwick/Filtlong.git
cd Filtlong
make -j
bin/filtlong -h

Address of the bookmark: https://github.com/rrwick/Filtlong

Senior Scientist (Agricultural Bio-informatics) (One post)

Wed, 24 Dec 2014 05:01:02 -0600

Agricultural Scientists Recruitment Board

Qualifications Essential:
Doctoral degree in Bio-informatics/ Biotechnology/Molecular Biology and Biotechnology/Life Sciences/ Computer Sciences with specialization in Bio-informatics including relevant basic sciences with 8 years’ experience in the relevant subject as Scientist/Lecturer or in an equivalent position in the Pay Band- 3 of 15600-39100 with Grade Pay of 5400/6000/7000/8000 having made contribution to research/teachin/extension education as evidenced by published work/innovations and impact.

Doctoral degree in the above subject(s) including relevant basic sciences with minimum 8 years’ experience of high quality post-doctoral research in an institution/organization as evidenced by at least 6 publications in journals with NAAS rating of 7.5 or above.

Desirable:
(i) Specialization and experience: Knowledge of software development and its application in crop bioinformatics, experience in handling ‘omies’data.
(ii) Teaching experience in relevant subject

The Secretary, Agricultural Scientists Recruitment Board, Indian Council of Agricultural Research Krishi Anusandhan Bhavan-I, Pusa New Delhi –110 012, India

Detailed eligibility criteria with how to apply information can be had at:
http://www.indiastudychannel.com/jobs/333467-Indian-Council-of-Agricultural-Research-looking-for-Assistant-Director-General.aspx

More at http://asrb.org.in/administrator/uploads_dir/1418978057english.pdf

SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins

BioStar — Mon, 17 Aug 2020 05:25:10 -0500

SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:

Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome
Co-assembly of a large number of metagenomes via merging of individual metagenomes
Includes binning and bin checking, for retrieving individual genomes
The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.
Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.
Metatranscriptomic support via mapping of cDNA reads against reference metagenomes

Address of the bookmark: https://github.com/jtamames/SqueezeMeta