BOL: Related items

ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly

Rahul Nayak — Tue, 03 Jul 2018 04:09:46 -0500

With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries. Texas A&M University researchers develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory. Availability – A software program that implements the algorithm is available at: http://faculty.cse.tamu.edu/shsze/asplice. Sze SH, Pimsler ML, Tomberlin JK, Jones CD, Tarone AM. (2017) A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms. BMC Genomics 18(Suppl 4):387.

Address of the bookmark: http://faculty.cse.tamu.edu/shsze/asplice/

Traineeship/Studentship conducts University of Delhi (Gargi College)

Mon, 05 Sep 2016 03:45:58 -0500

Traineeship/Studentship cunducts University of Delhi (Gargi College) on purely temporary for a period of six months.
Traineeship — 01 (one post)
Essential Qualification: Post Graduate degree in Bioinformatics or any other branch of Life Sciences preferably with dissertation in Bioinformatics. Desirable Qualification: Prior knowledge of programming languages such as C, VB, SQL etc. and software/database development
Studentship- 01 (one post)
Essential Qualifications: Final year Post Graduate students pursuing a degree in Bioinformatics or any branch of Life Science with knowledge of bioinformatics
Salary: Rs.8000/- p.m.
How to apply
Interested candidates are required to appear for the walk in interview on 14th. September, 2016 at 9.30 AM in Principal's Office, Gargi College, Sirifort Road, N. Delhi-110049

More at http://www.du.ac.in/du/index.php?mact=News,cntnt01,detail,0&cntnt01articleid=12859&cntnt01returnid=83

MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph

Jit — Wed, 14 Nov 2018 04:50:27 -0600

MEGAHIT is a single node assembler for large and complex metagenomics NGS reads, such as soil. It makes use of succinct de Bruijn graph (SdBG) to achieve low memory assembly. MEGAHIT can optionally utilize a CUDA-enabled GPU to accelerate its SdBG contstruction. The GPU-accelerated version of MEGAHIT has been tested on NVIDIA GTX680 (4G memory) and Tesla K40c (12G memory) with CUDA 5.5, 6.0 and 6.5. MEGAHIT v1.0 or greater also supports IBM Power PC and has been tested on IBM POWER8.

https://academic.oup.com/bioinformatics/article/31/10/1674/177884

Address of the bookmark: https://github.com/voutcn/megahit

Bioinformatics openings at Sri Venkateswara College, University of Delhi

Tue, 20 Sep 2016 05:43:24 -0500

Bioinformatics center

Sri Venkateswara College (University of Delhi)

New Delhi- 110021

1. Junior Research Fellow (1 Post)

Applications are invited for the post of Junior Research Fellow (JRF) under DST funded project which is purely temporary and is strictly for project duration only.

Title of project

No. of post

Remuneration (Rs.)

“Computational assisted Design and Synthesis of Novel Antimalarial Agents Embodying Structural Diversity Suitable for Protease Inhibitors”

(One)

Fellowship and HRA as per DST guidelines

Qualification

Post Graduate Degree in Basic Science (M.Sc./M.Tech in Bioinformatics/Biophysics) from a recognized University in India or abroad with at least 55% marks with NET qualification or Graduate Degree in Professional Course with NET Qualification or Post Graduate Degree in Professional Course.

Desirable

Fair knowledge of Computer Aided Drug Designing (CADD), Protein Structure modeling, molecular docking, and simulations are preferable.

2. Traineeship (1 Post)

Applications are invited for the position of traineeship in DBT-BTISnet funded Bioinformatics Infrastructure Facility (BIF) to carry out project work in the area of Bioinformatics.

Qualification

Applicant should be possess PG degree/PG diploma in Bioinformatics for traineeship. The traineeship is awarded for a period of six months from the date of joining and is not extendable. The selected candidates are entitled to receive a stipend of Rs. 8000/- per month (consolidate) for a period of 6 months.

=====================================================================

3. Studentship (1 Post)

Applications are invited for the position of Studentship in DBT-BTISnet funded Bioinformatics Infrastructure Facility (BIF) to carry out project work in the area of Bioinformatics.

Qualification

Candidates pursuing the Final Year of Post Graduate Degree in Basic Science (M.Sc.) or Post Graduate/ Graduate Degree in Professional Course (M.Tech/B.Tech) in Bioinformatics from a recognized University in India or abroad. The selected candidates are entitled to receive a stipend of Rs. 8000/- per month (consolidate) for a period of 6 months.

How to Apply?

Applicants are required to send applications on plain paper, stating the name, address, date of birth, educational qualification, experience and Institute, along with attested photocopies of mark sheets and certificates etc. by September 20, 2016 to:

The Coordinator

Bioinformatics Center, Sri Venkateswara College

Benito Juarez Road, Dhaula Kuan, New Delhi- 110021

Applications may also be sent by email to contact@bic-svc.ac.in. Strictly mention "Application for JRF, Traineeship or Studentship" in the subject line as the case may be.

Short listed candidates will be called for an interview. Canvassing in any form will be a disqualification. No TA/DA will be paid either for attending the interview or joining the post.

For more details visit our lab webpage: http://www.bic-svc.ac.in

NxRepair: error correction in de novo assemblies using Nextera Mate Pair Reads

BioStar — Thu, 24 Jan 2019 10:35:12 -0600

NxRepair is a python module that automatically detects large structural errors in de novo assemblies using Nextera mate pair reads. The decector will break a contig at the site of an identified misassembly and will generate a new fasta file containing both the corrected contigs and the correct, unaffected contigs.

https://nxrepair.readthedocs.io/en/latest/tutorial.html

nxrepair aligned_matepairs.bam assemblyfasta.fasta error_locations.csv new_fasta.fasta

Address of the bookmark: https://github.com/rebeccaroisin/nxrepair

COSMIC

Jit — Sat, 01 Oct 2016 15:04:10 -0500

The accurate description and annotation of structural variants can be complex. This is due to the different resolution that variants are reported from traditional cytogenetic coordinates down to the actual base pair positions. Furthermore, multiple rearrangements in a single area of the genome can make cataloguing and interpreting their effects challenging.

The Rearrangement Overview page describes the one or more breakpoints which make up a structural variant. A breakpoint is defined as a region or point where the sample sequence has altered from the reference sequence. Minimum interpretation is made of this data. One variant event can consist of one or multiple breakpoints. The Syntax (shown above the table) gives a detailed description of the variant and its location (e.g. chr11:g.36585230_76606619del, a deletion of roughly 40Mb on chromosome 11). Syntax is based on HGVS mutation nomenclature recommendations [http://www.hgvs.org/rec.html].

http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview

Address of the bookmark: http://cancer.sanger.ac.uk/cosmic/help/rearrangement/overview

SDA: Long-read sequence and assembly of segmental duplications

Jit — Tue, 05 Mar 2019 10:00:57 -0600

Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of long reads corresponding to distinct paralogs.

https://github.com/mvollger/SDA

Address of the bookmark: https://www.nature.com/articles/s41592-018-0236-3

CONTIGuator !

BioStar — Fri, 04 Oct 2019 01:27:58 -0500

CONTIGuator is a Python script for Linux environments whose purpose is to speed-up the bacterial genome assembly process and to obtain a first insight of the genome structure using the well-known artemis comparison tool (ACT).

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

Beagle

Jit — Thu, 27 Oct 2016 11:19:00 -0500

Beagle is a software package that performs genotype calling, genotype phasing, imputation of ungenotyped markers, and identity-by-descent segment detection.

Beagle version 4.1 has a more accurate genotype phasing algorithm and a very fast and accurate genotype imputation algorithm. Version 4.1 also has several changes to the command line arguments which are described in the release notes. The "ped" argument has no effect in version 4.1. If your data contains nuclear families and you want to model the parent-offspring relationships when phasing genotypes, please use version 4.0.

If you use Beagle 4.1 in a published analysis, please report the program version and cite the appropriate article.

The citation for Beagle's phasing algorithm is:

S R Browning and B L Browning (2007) Rapid and accurate haplotype phasing and missing data inference for whole genome association studies by use of localized haplotype clustering. Am J Hum Genet 81:1084-1097.doi:10.1086/521987

The citation for Beagle's genotype imputation algorithm is:

B L Browning and S R Browning (2016). Genotype imputation with millions of reference samples. Am J Hum Genet 98:116-126.doi:10.1016/j.ajhg.2015.11.020

The citation for Beagle's IBD detection algorithm is:

B L Browning and S R Browning (2013). Improving the accuracy and efficiency of identity-by-descent detection in population data. Genetics 194(2):459-71.doi:10.1534/genetics.113.150029

Address of the bookmark: http://faculty.washington.edu/browning/beagle/beagle.html

ART: Set of Simulation Tools

Jit — Thu, 03 Nov 2016 08:28:25 -0500

ART is a set of simulation tools to generate synthetic next-generation sequencing reads. ART simulates sequencing reads by mimicking real sequencing process with empirical error models or quality profiles summarized from large recalibrated sequencing data. ART can also simulate reads using user own read error model or quality profiles. ART supports simulation of single-end, paired-end/mate-pair reads of three major commercial next-generation sequencing platforms: Illumina's Solexa, Roche's 454 and Applied Biosystems' SOLiD. ART can be used to test or benchmark a variety of method or tools for next-generation sequencing data analysis, including read alignment, de novo assembly, SNP and structure variation discovery. ART was used as a primary tool for the simulation study of the 1000 Genomes Project . ART is implemented in C++ with optimized algorithms and is highly efficient in read simulation. ART outputs reads in the FASTQ format, and alignments in the ALN format. ART can also generate alignments in the SAM alignment or UCSC BED file format. ART can be used together with genome variants simulators (e.g. VarSim) for evaluating variant calling tools or methods.

Address of the bookmark: http://www.niehs.nih.gov/research/resources/software/biostatistics/art/