BOL: Related items

JRF in Bioinformatics @ NEHU

Tue, 20 Jan 2015 22:57:49 -0600

Department of Botany & Bioinformatics Centre
NORTH-EASTERN HILL UNIVERSITY, SHILLONG 793022

Applications with complete bio-data from candidates possessing the required qualifications are invited for the posts of JRF (2) and Project Assistant (1) in

DBT, GOI-funded research project “Next Generation Sequencing (NGS)- based de novo assembly of expressed transcripts and genome information of Orchids in North-East India” in DBT’s Twinning programme for NE as per DBT sanction order and norms.

(i) JRF(2 nos.):

Qualifications: M.Tech/M.Sc in Life Sciences/ Botany/ Zoology/Biochemistry/ Biotechnology/ Bioinformatics; Desirable: Aptitude for Bioinformatics and Computer Programming/ Next generation sequencing data analysis

(ii) Project Assistant (1 no.):

Qualifications: Graduation in Science, Desirable: Experience of working in a Life Science/Plant Biotechnology lab. and familiarity with computers and field work viz. collection of samples.

The applications through email bicnehu@gmail.com or post must reach the undersigned
within 15 days from the date of publication of this advertisement. The advertised posts are purely temporary for the duration of the project and subject to availability of the funds from DBT. The appointment does not confer any entitlement or right over the posts for absorption in the University service.

Advertisement: www.nehu.ac.in/Advertisements/BICAdvtPV_200115.pdf

GRASS: a generic algorithm for scaffolding next-generation sequencing assemblies.

Abhimanyu Singh — Tue, 23 May 2017 05:20:32 -0500

GRASS (GeneRic ASsembly Scaffolder)-a novel algorithm for scaffolding second-generation sequencing assemblies capable of using diverse information sources. GRASS offers a mixed-integer programming formulation of the contig scaffolding problem, which combines contig order, distance and orientation in a single optimization objective. The resulting optimization problem is solved using an expectation-maximization procedure and an unconstrained binary quadratic programming approximation of the original problem. We compared GRASS with existing HTS scaffolders using Illumina paired reads of three bacterial genomes. Our algorithm constructs a comparable number of scaffolds, but makes fewer errors. This result is further improved when additional data, in the form of related genome sequences, are used.

Address of the bookmark: https://github.com/AlexeyG/GRASS

20th International BioInformatics Workshop on Virus Evolution and Molecular Epidemiology (VEME)

Mon, 12 Jan 2015 01:39:45 -0600

20th International BioInformatics Workshop on Virus Evolution and Molecular Epidemiology (VEME)
9 - 14 August 2015 St. Augustine, Trinidad and Tobago

Organiser: Christine Carrington (University of the West Indies - UWI, St. Augustine, Trinidad and Tobago)
Co-organisers: Anne-Mieke Vandamme, Philippe Lemey (Katholieke Universiteit Leuven, Belgium), Marco Salemi, Mattia Prosperi (University of Florida, Gainesville, USA) and Karen E. Nelson (J. Craig Venter Institute, Rockville, USA)

Requests for information directly to:
Christine Carrington
Department of Preclinical Sciences
Faculty of Medical Sciences
University of the West Indies (UWI)
St. Augustine
Trinidad and Tobago
Telephone: +1-868-6452640 ext. 5009, +1-868-6848803
Fax: +1-868-6621873
E-mail: veme2015@sta.uwi.edu

Deadline for receipt of applications by local organiser: 15 March 2015
CALL FOR APPLICATIONS NOW OPEN
http://www.icgeb.org/course-application-trinidad-and-tobago-2015.html

http://rega.kuleuven.be/cev/veme-workshop/2015

MIX: Combining multiple assemblies from NGS data

Rahul Nayak — Tue, 08 May 2018 04:58:05 -0500

Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.

The Mix algorithm, approach and results were published in BMC bioinformatics : http://www.biomedcentral.com/1471-2105/14/S15/S16.

Address of the bookmark: https://github.com/cbib/MIX

WuXi has acquired NextCODE Health

Pranjali Yadav — Mon, 19 Jan 2015 08:17:35 -0600

Shanghai, China-headquartered pharmatech company WuXi (NYSE: WX) has acquired NextCODE Health, a genomic analysis and bioinformatics company based in the USA.

The acquisition was made for $65 million in cash, and WuXi plans to merge its genome center with NextCODE Health to form a new company, WuXi NextCODE Genomics. The business will be headquartered in Shanghai and have operations in Cambridge, Massachusetts, and Reykjavik, Iceland.

With the huge unmet medical needs in diseases with a genetic component and the rapid advances in genomics and bioinformatics, now is the right time for WuXi to make a strategic investment in this field, and NextCODE is the right partner. This new venture of WuXi NextCODE Genomics will create important new genomic and bioinformatic products and services to help make personalized treatment and medicine a reality. It will also enable doctors to provide better treatments to patients.

HALC: High throughput algorithm for long read error correction

Jit — Fri, 08 Jun 2018 10:47:41 -0500

HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach) HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.

Address of the bookmark: https://github.com/lanl001/halc

RA Bioinformatics at CIBA

Fri, 13 Feb 2015 11:23:18 -0600

Recruitment The following posts are to be filled purely on temporary basis under CIBA Component of “Centre for Agricultural Bioinformatics (CABin)” project at this Institute.

Posts Research Associate

Date & Time of Interview 18th Feb 2015 at 10.00 a.m.

Project Name “Centre for Agricultural Bioinformatics (CABin)”

Duration 12th Plan (2012-2017) / co-terminus with the project 12th Plan (2012-2017) / co-terminus with the project

Essential Qualification Ph.d / M.Sc./ M.Phil (Bioinformatics) With 1st division or 60% marks or equivalent overall grade point average with at least two years of research experience in the relevant subject.

Technician

B.Tech. or Master degree in computer science/Computer Engineering /MCA or equivalent. Desirable qualification: Experience in Java/ C++/ PHP/ PERL/ Python etc. based application development using Linux, Apache and MySQL/Oracle.

Emoluments Rs.24000/- p.m. + 30% HRA for Ph.D holders / Rs.23000/- p.m. + 30% HRA for Master Degree holders A consolidated pay Rs.25000/- per month.

Age Limit Maximum 40 years for men and 45 years for women as on date of interview.

Age limits are relaxable for SC / ST / OBC candidates as per rules.

Maximum 40 years for men and 45 years for women as on date of interview.

Age limits are relaxable for SC / ST / OBC candidates as per rules.

Eligible Candidates may send their Curriculum Vitae along with the contact numbers to ashok@ciba.res.in on or before 13-02-2015.

Candidates selected after initial screening will be called for interview.

Advertisement: www.ciba.res.in/attachments/jobs/CABin-3006.pdf

nanofilt: Filtering and trimming of long read sequencing data

Jit — Mon, 30 Jul 2018 12:01:52 -0500

Filtering on quality and/or read length, and optional trimming after passing filters.
Reads from stdin, writes to stdout.

Intended to be used:

directly after fastq extraction
prior to mapping
in a stream between extraction and mapping

https://github.com/wdecoster/nanofilt

Address of the bookmark: https://github.com/wdecoster/nanofilt

Postdoctoral Researcher at Department of Biotechnology, Catholic University of Daegu, Kyungsan, Kyungbuk, South Korea.

Thu, 29 Jan 2015 12:11:16 -0600

Applications are invited from Indian nationals for a Post Doctoral position at Molecular Medical Laboratory, Department of Biotechnology, Catholic University of Daegu, Kyungsan, Kyungbuk, South Korea.

Qualification required: PhD in Life Sciences/ Molecular Biology/ Bioinformatics or related discipline.

Desirable Qualification:

1. Candidates having experience in molecular biology techniques and must be well versed with bioinformatics tool or expert in relevant fields will be preferred.
2. The candidate should have good communication skill, knowledge about designing experiments and analyzing data.
3. Sense of initiative, autonomy, organization and thoroughness, good relation qualities.
Remuneration: 2000USD per month.

Last date of submitting the complete applications furnishing Bio-data is 10th February, 2015.

Interested candidates should send their resume including all personal as well as academic details to the principal investigator Prof Seung-Won Park (email:microsw@cu.ac.kr)

The shortlisted candidates will be intimated within February 2015.

BASE: a practical de novo assembler for large genomes using long NGS reads

Rahul Nayak — Fri, 19 Oct 2018 07:25:21 -0500

new de novo assembler called BASE. It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs.

Address of the bookmark: https://github.com/dhlbh/BASE