BOL: Related items

Protein function annotation and machine learning - UPMC - Paris, France

Sat, 02 Aug 2014 01:22:52 -0500

Protein function annotation and machine learning - UPMC - Paris, France

Job Description: We are interested in finding an excellent postdoc with interests in protein functional annotation, machine learning and computer grids. The position is open for 3.5 years at the Université Pierre et Marie Curie, in the heart of paris.

Research topic: Protein function annotation, multiple probabilistic models, domain architecture, machine learning, combinatorial optimization, computer grid.

Title: A novel integrative platform for large scale protein annotation that exploits a multitude of diversified probabilistic models in several protein signature databases.

We propose a novel integrated approach for large scale protein annotation that will exploit an unprecedented amount of genomic data as well as sophisticated machine learning techniques and combinatorial optimization approaches taking advantages of High Performance Computing (HPC) environments. The idea is to uncover as much as possible the evolutionary processes of protein sequences that took place throughout the whole tree of life and that affected the evolution of a protein family. We have already demonstrated in a previous work that the problem of functional annotation is inherent to the ability of uncovering such paths. Now, we shall extend this approach to large scale genome annotation by considering 11 different protein databases, constituted by about 10^9 protein sequences, and by producing a large pool of diversified probabilistic models coding for about 10^7 evolutionary protein pathways. Such models will be used to search for specific domains in genomes to be annotated. Our previous methodology needs to be fundamentally improved to deal with this large amount of biological data. In this project, we shall work on the algorithms to reduce the space of models and the search complexity, and we shall implement some important algorithmic changes towards the realization of a powerful integrated annotation tool.

Where: This project is run on the Laboratoire de Biologie Computationnelle et Quantitative UMR7238 CNRS-UPMC – Analytical Genomics team, headed by A.Carbone. It is co-advised with Pierre-Henri Wuillemin, Laboratoire d’Informatique de Paris 6 – Equipe DECISION.

Start date: September 1st, 2014
Contact Person: Alessandra Carbone
Contact: alessandra.carbone@lip6.fr

karyoploteR: plot whole genomes with arbitrary data

Abhimanyu Singh — Fri, 02 Feb 2018 03:24:28 -0600

karyoploteR is an R package to create karyoplots, that is, representations of whole genomes with arbitrary data plotted on them. It is inspired by the R base graphics system and does not depend on other graphics packages. The aim of karyoploteR is to offer the user an easy way to plot data along the genome to get broad genome-wide view to facilitate the identification of genome wide relations and distributions.

Address of the bookmark: https://bernatgel.github.io/karyoploter_tutorial/

Swabs to Genomes: A Comprehensive Workflow

Rahul Nayak — Sun, 10 Aug 2014 03:01:21 -0500

The sequencing, assembly, and basic analysis of microbial genomes, once a painstaking and expensive undertaking, has become almost trivial for research labs with access to standard molecular biology and computational tools. However, there are a wide variety of options available for DNA library preparation and sequencing, and inexperience with bioinformatics can pose a significant barrier to entry for many who may be interested in microbial genomics. The objective of the present study was to design, test, troubleshoot, and publish a simple, comprehensive workflow from the collection of an environmental sample (a swab) to a published microbial genome; empowering even a lab or classroom with limited resources and bioinformatics experience to perform it.

Address of the bookmark: https://peerj.com/preprints/453.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

Assistant Professor in Bioinformatics at Indian Institute of Technology Delhi

Fri, 15 Aug 2014 06:16:06 -0500

Indian Institute of Technology Delhi Hauz Khas ,New Delhi – 110016

ROLLING ADVERTISEMENT NO. 01/2014(E-1)
ADVERTISEMENT FOR THE POSITIONS OF ASSISTANT PROFESSOR CANDIDATES CAN APPLY ANY TIME DURING THE YEAR.

IIT Delhi invites applications from qualified Indian Nationals, Persons of Indian Origin (PIOs) and Overseas Citizens of India (OCIs) for the following positions in the various Departments/Centres/Schools (in the fields
mentioned alongwith them):
Post Pay Band Assistant Professor and Assistant Professor (on Contract) Rs.15600-39100 (PB-3) (Minimum pay of Rs.30000/-)+ AGP Rs.8000/-

The following norms will be followed for fixing the basic pay + AGP for Assistant Professors appointed on
contract with Ph.D but experience of 3 years or less:-
Type Qualification & Experience on the date of joining
Assistant Professor (Contract) PB3 (Rs. 15,600-39,100).

MINIMUM QUALIFICATIONS AND EXPERIENCE:
Ph.D. with First class at the preceding degree or equivalent in the appropriate branch with very good academic record throughout. A minimum of three years industrial/research/teaching experience, excluding however, the experience gained while Pursuing Ph. D. The candidates should preferably be below
35 years of age for male and 38 years for female ( to be relaxed by 5 years in case of persons with physical disability, SC/ST and 3 years in case of OBC-NCL).

Qualified persons include:
(a) Indian Nationals,
(b) Foreign Nationals who are “Persons of Indian Origin” (PIO) or Overseas
Citizens of India (OCI), in whose case, if selected, permission will be sought from Govt. of India
before he/she can join IIT Delhi, or
(c) Other Foreign Nationals, in whose case, if selected, appointment will be on a contract basis for up to 5 (five) years subject to permission from the Govt. of India before he/she can join IIT Delhi.
(d) Institute specifically encourages applicants from SC/ST/OBC category as well as persons
with disability to apply for these positions.

AMAR NATH & SHASHI KHOSLA SCHOOL OF INFORMATION TECHNOLOGY:
Computational Neuroscience, Medical Applications of Information Technologies, Computational & Systems Biology, Machine to Machine (M2M) Technologies, Embedded Systems & Sensors, Computer Security.
KUSUMA SCHOOL OF BIOLOGICAL SCIENCES:
In-silico Biology Applications, Systems Biology, Infection Biology, Neurodegeneration.

More at http://www.iitd.ac.in/sites/default/files/jobs/faculty/spl-areas-rolling-advt.pdf

http://www.iitd.ac.in/content/faculty-positions

MeDuSa: a multi-draft based scaffolder

Abhimanyu Singh — Wed, 14 Feb 2018 02:49:00 -0600

MeDuSa (Multi-Draft based Scaffolder), an algorithm for genome scaffolding. MeDuSa exploits information obtained from a set of (draft or closed) genomes from related organisms to determine the correct order and orientation of the contigs. MeDuSa formalises the scaffolding problem by means of a combinatorial optimisation formulation on graphs and implements an efficient constant factor approximation algorithm to solve it. In contrast to currently used scaffolders, it does not require either prior knowledge on the microrganisms dataset under analysis (e.g. their phylogenetic relationships) or the availability of paired end read libraries.

Address of the bookmark: https://github.com/combogenomics/medusa

Lecturer/Senior Lecturer (Level B/C) in Bioinformatics

Fri, 22 Aug 2014 12:45:52 -0500

Lecturer/Senior Lecturer (Level B/C) in Synthetic Biology, Research Fellow (Level B) in Synthetic Biology & Lecturer/Senior Lecturer (Level B/C) in Bioinformatics

Apply now Job no: 494553
Work type: Continuing full time
Vacancy type: External Vacancy, Internal Vacancy
Categories: Academic - Teaching and Research

The Faculty of Science is launching a new and innovative branch of biological science at Macquarie University – Synthetic Biology. Synthetic biology combines engineering principles with molecular biological approaches to design and construct biological devices and systems. Recent highlights in this field include the design and synthesis of a functional bacterial genome and a yeast chromosome, and generation of synthetic bacterial cells. The rational synthesis of "designer" organisms yield important insights into how organisms work and has the potential to revolutionise biotechnological applications in areas such as bioenergy and biomanufacturing.

Find more at http://jobs.mq.edu.au/cw/en/job/494553/lecturersenior-lecturer-level-bc-in-synthetic-biology-research-fellow-level-b-in-synthetic-biology-lecturersenior-lecturer-level-bc-in-bioinformatics

Porechop: tool for finding and removing adapters from Oxford Nanopore reads

Rahul Nayak — Tue, 29 May 2018 07:33:44 -0500

Porechop is a tool for finding and removing adapters from Oxford Nanopore reads. Adapters on the ends of reads are trimmed off, and when a read has an adapter in its middle, it is treated as chimeric and chopped into separate reads. Porechop performs thorough alignments to effectively find adapters, even at low sequence identity.

Porechop also supports demultiplexing of Nanopore reads that were barcoded with the Native Barcoding Kit, PCR Barcoding Kit or Rapid Barcoding Kit.

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

PhD opportunity at Université de Liège - Belgium

Mon, 01 Sep 2014 17:16:22 -0500

The Bioinformatics and Systems Biology Unit of Université de Liège (Belgium) is looking for a highly motivated master student with programming skills for a PhD thesis project (4 years, fully funded) with the goal of designing computational tools that use literature, genomic and structural data in order to infer regulatory and metabolic networks.

Applicants are invited to send their resume and a recommendation letter to Prof. Patrick Meyer (more details at www.biosys.ulg.ac.be )

RNA-seq Analysis Workshop Course Materials

Jit — Tue, 03 Jul 2018 08:14:14 -0500

RNAseq can be roughly divided into two "types": Reference genome-based - an assembled genome exists for a species for which an RNAseq experiment is performed. It allows reads to be aligned against the reference genome and significantly improves our ability to reconstruct transcripts. This category would obviously include humans and most model organisms but excludes the majority of truly biologically intereting species (e.g., Hyacinth macaw); Reference genome-free - no genome assembly for the species of interest is available. In this case one would need to assemble the reads into transcripts using de novo approaches. This type of RNAseq is as much of an art as well as science because assembly is heavily parameter-dependent and difficult to do well. In this lesson we will focus on the Reference genome-based type of RNA seq. http://chagall.med.cornell.edu/RNASEQcourse/

Address of the bookmark: http://chagall.med.cornell.edu/RNASEQcourse/