BOL: Related items

PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM and Look Ahead Approach

Rahul Nayak — Tue, 05 Jun 2018 09:57:11 -0500

PERGA - Paired End Reads Guided Assembler PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct contig, PERGA uses paired-end reads and different read overlap sizes from O ≥ Omax to Omin to resolve the gaps and branches. Moreover, by constructing a decision model using machine learning approach based on branch features, PERGA can determine the correct extension in 99.7% of cases. PERGA will try to extend the contigs by all feasible nucleotides and determine if these multiple extensions due to sequencing errors or repeats by using looking ahead technology, and it also try to separate the different repeats of nearby genomic regions to make the assembly result more longer and accurate. The simulated E.coli paired-end reads data are generated using GemSim (KE McElroy, F Luciani, T Thomas. Gemsim: General, Error-Model Based Simulator of Next-Generation Sequencing Data. BMC Genomics 2012, 13:74), with coverage 50x, 60x, 100x, read lengths 100-bp, and can be downloaded from https://github.com/zhuxiao/data_PERGA.

Address of the bookmark: https://github.com/hitbio/PERGA

JRF Bioinformatics job vacancies in Tezpur University

Tue, 14 Feb 2017 16:40:26 -0600

Memo No. DoRD/CSE/SSS/20-295/112-A Date: 01/02/2017

Project Title : Integrating genome scale metabolic analysis of model plant pathogen Ralstonia solanacearum with RNAseq and fluxomics

Essential qualification : M.Tech. in CSE/IT (With specialization in Computational Biology/Bioinformatics) or M.Sc. in Bioinformatics/Biosciences/Molecular Biology Biotechnology preferably with NET/GATE/BET. Candidates should have minimum 55 % mark both in 10th and 10+2 Science examinations and mathematics at 10+2 Science. Desirable: Preference will be given to the candidates having experience in computational analysis of genome sequences or similar projects.

No. of Post : 01

Remuneration : Rs. 25,000/- for the 1st two years and Rs. 28,000/- for the 3rd year for SRF and applicable to the candidate having post graduate degree in Basic Science with NET/GATE/BET qualification or post graduate degree in professional course. Rs. 12,000/- for the 1st two years and Rs. 14,000/- for the 3 rd year for SRF,

Age : 28 years

Duration : Three (03) years or till completion of the project or until further order, whichever is earlier.

Hiring Process : Walk - In
Job Role: Research/JRF/SRF

Walk-in-interview will be held on 17th February, 2017, 11.15 a.m. at the office of the Head, Department of Computer Science and Engineering, Tezpur University.

Interested candidates may appear before the interview board with original documents from 10th standard onwards and photocopies of mark sheets, certificates, testimonials, caste certificate (if applicable), experience certificate certificates of NET/GATE/BET or similar examination qualifications, any other testimonials and a copy of recent curriculum vitae (CV) on the day of interview.

More at http://www.tezu.ernet.in/ProjectWalkin/Advt-DoRD-CSE-SSS-20-295-112-A.pdf

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/

Postdoctoral Research Position in Bioinformatics in Milan

Thu, 20 Apr 2017 12:53:12 -0500

The lab of Immunobiology of Neurological Disorders has a main interest in the biological processes associated with multiple sclerosis, an inflammatory disorder of the central nervous system. The projects of interest for this application involve research on translational bioinformatics in complex human neurological disorders.

You have a PhD in Computational Science, Bioinformatics, or equivalent, and expertise in analysis and modeling of human RNA-seq data, statistics, data mining and machine learning. Excellent communication skills in English (written and oral) is a must. Flexibility and willingness to work across multiple projects and technologies in a rapidly evolving scientific context is required.
Salary will depend on qualification and experience. Starting date: immediate.

Interested candidates should send to farina.cinthia@hsr.it:

1. CV (please show evidences of relevant titles, projects, courses, references, etc.)
2. One page with a list of research topics (i.e. ongoing projects)
3. earliest availability

4. 2-3 contact names

Bioinformatics walk-in-interview at Tezpur University

Thu, 02 Mar 2017 04:24:46 -0600

A walk-in-interview will be held on 09 March, 2017, 11.15 a.m. at the office of the Head, Department of Computer Science and Engineering, Tezpur University for one (01) temporary position of Junior Research Fellow (JRF) in the DBT, Govt. of India sponsored project entitled “Integrating genome scale metabolic analysis of model plant pathogen Ralstonia solanacearum with RNAseq and fluxomics” under Dr. Siddhartha Sankar Satapathy (ssankar@tezu.ernet.in), Associate Professor, Department of Computer Science and Engineering, Tezpur University.

Interested candidates may appear before the interview board with original documents from 10th standard onwards and photocopies of mark sheets, certificates, testimonials, caste certificate (if applicable), experience certificate certificates of NET/GATE/BET or similar examination qualifications, any other testimonials and a copy of recent curriculum vitae (CV) on the day of interview.

Essential qualification: M.Tech. in CSE/IT (With specialization in Computational Biology/Bioinformatics) or M.Sc. in Bioinformatics/Biosciences/Molecular Biology Biotechnology preferably with NET/GATE/BET.

Candidates should have minimum 55 % mark both in 10th and 10+2 Science examinations and mathematics at 10+2 Science.

Desirable: Preference will be given to the candidates having experience in computational analysis of genome sequences or similar projects.

Remuneration: Rs. 25,000/- (Rupees twenty five thousand) only + HRA as admissible per month for the 1st two years and Rs. 28,000/- (Rupees twenty eight thousand) only + HRA as admissible per month for the 3rd year for SRF and applicable to the candidate having post graduate degree in Basic Science with NET/GATE/BET qualification or post graduate degree in professional course. Rs. 12,000/- (Rupees twelve thousand) only + HRA as admissible per month for the 1st two years and Rs. 14,000/- (Rupees fourteen thousand) only + HRA as admissible per month for the 3 rd year for SRF, for the candidate without NET/GATE/BET qualification. HRA will not be provided if campus accommodation is availed.

Age: Candidate shall not be more than 28 years of age on the date of interview. Upper age limit may be relaxed up to 5 years in the case of candidate belonging to SC/ST/ OBC/Women/Differently abled.

Duration: Three (03) years or till completion of the project or until further order, whichever is earlier.

N.B. No TA/DA will be paid to the candidates for attending the interview. For further details please contact: Dr. S. S. Satapathy Associate Professor Department of Computer Science and Engineering Tezpur University, Napaam-784028 Email: ssankar@tezu.ernet.in Contact no.: +91-9435979648

More Info: www.tezu.ernet.in/ProjectWalkin/Advt-DoRD-CSE-SSS-20-295-188-A.pdf

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

Fools guide

Poonam Mahapatra — Sun, 02 Apr 2017 14:31:18 -0500

This website and accompaning documents are intended as a tool to help researchers dealing with non-model organisms acquire and process transcriptomic high-throughput sequencing data without having to learn extensive bioinformatics skills. It covers all steps from tissue collection, sample preparation and computer setup, through addressing biological questions with gene expression and SNP data.

http://sfg.stanford.edu/denovo.html

http://sfg.stanford.edu/sequencing.html

http://sfg.stanford.edu/BLAST.html

http://sfg.stanford.edu/denovo.html

Address of the bookmark: http://sfg.stanford.edu/guide.html

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

Lifemap

Jit — Mon, 10 Apr 2017 05:42:37 -0500

Lifemap is an interactive tool to explore the WHOLE NCBI TAXONOMY. The concept used in Lifemap is similar to the one used in cartography with tools like Google Maps© or Open Street Maps: exploring is done by zooming and panning.

The current tree contains ALL species present in NCBI taxonomy as of October 18th, 2016: 1,135,169 species including 10,545 Archaea, 418,777 Bacteria and 705,847 Eukaryotes. The Lifemap tree is updated every two weeks.

All the nodes in the tree are clickable. This displays various information and options:

The species name (and the associated common name if there is one)
The rank (kingdom, family, class, species...)
Ability to go to the corresponding node/species on NCBI web site (displayed in a new window)
Possibility to download the corresponding subtree in newick extended format
Possibilty to get the whole lineage from the current node/tip to the root of the tree.

Address of the bookmark: http://lifemap-ncbi.univ-lyon1.fr/

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