We are seeking a highly motivated young PhD student with strong interest in high throughput data analysis.
Detailed descriptions of our recent research activities may be found here:
http://www.humanitas-research.org/condorelli-gianluigi-md-phd/

Position is available starting from October/November. A probationary period of one month will be required.

Please send a CV along with a cover letter stating the reasons for applying and contact details of one or more referees to Dr. Paolo Kunderfranco (paolo.kunderfranco@humanitasresearch.it).

Following are the list of Ancestral /sequence/ reconstruction (ASR) tools: 

inferCars

Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.

ANGES:reconstructing ANcestral GEnomeS maps

A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.

Cocos

Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.

MySSP

Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.

PARANA: Parsimonious Ancestral Reconstruction And Network Analysis

Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.

GapAdj: Gapped Adjacencies

A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).

ANCESTOR

A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.

ProCARs

Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.

FastML

A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.

maxAlike

Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.

MLGO: Maximum Likelihood for Gene Order Analysis

A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.

Image Reference : Wiki

Sector 8, Dwarka, Delhi -110077

WALK IN INTERVIEW

One position of project fellow is to be filled up in a DRL- funded research project on Molecular and morphological characterization of An. fluviatilis in North-eastern states and bordering areas. The position is purely temporary for one year and can be extended

Essential qualifications

Master’s degree in any branch of Life Sciences with hands on experience in molecular biology and/or bioinformatics.

Age limit: 28 years, (relaxation for SC/ST/OBC candidates as per government of India rules)

Stipend: Rs.12, 000.00 per month (fixed)

Eligible candidates may walk in for an interview on 15 November 2013 at 11 AM at the above mentioned address along with a copy of CV (with a passport size photograph affixed), photocopies of all mark sheets/certificates and originals (for verifications). No TA/DA will be paid for attending the interview .Registration of candidates will start at 10:00AM and end at 10:45 AM.

Advertisement: http://www.mrcindia.org/vacancy/add-4.doc

Lab page @ http://graveleylab.cam.uchc.edu/Graveley/index.html

It efficiently constructs gene networks from expression data. It allows the user to use ten different network construction methods (such as partial correlation-, likelihood-, Bayesian- and mutual information-based methods) and integrates the resulting networks from multiple methods. Hub gene information, if available, can be incorporated to enhance performance.

GeNeCK is an efficient and easy-to-use web application for gene regulatory network construction. It can be accessed at http://lce.biohpc.swmed.edu/geneck

Address of the bookmark: http://lce.biohpc.swmed.edu/geneck/

Location : The Luxembourg Centre for Systems Biomedicine (LCSB) at the University of Luxembourg, Luxembourg, Luxembourg
Deadline for applications : unknown.
Description :

The Luxembourg Centre for Systems Biomedicine (LCSB) was created within the Health Technologies Initiative from the Government of Luxembourg as one of the research priorities of the University of Luxembourg. The LCSB is an Interdisciplinary Centre of the University that combines experimental and computational approaches to analyse complex biological systems and disease processes. The Computational Biology Group (CBG) provides the LCSB with a solid infrastructure in developing theoretical framework for computational modeling on biomedical problems, especially in the area of network biology in the context of cellular programming/reprogramming. The CBG group includes researchers with theoretical, computational and wet lab backgrounds, thereby providing an unusually interdisciplinary environment.
The Computational Biology Group seeks a highly-skilled Ph.D. student to work on an exciting project on reconstruction and analysis of an integrated gene regulatory network model to elucidate key mechanisms of cellular reprogramming. The model will rely on the integration and mining of diverse transcriptomics and epigenomics data of different cell types from the Central Nervous System. The Ph.D. student is expected to collaborate with other members of the CBG to develop a computational methodology aiming at designing, in-silico, cellular reprogramming events, with a focus on the nervous system. This project will be carried out in collaboration with Prof. Noel Buckleys lab at Kings College London.
Requirements of the ideal candidate:
Master degree in Bioinformatics, Computer Science, Biology or a related discipline
Prior experience in mathematical modelling of biological networks, especially in network inference and analysis
Excellent working knowledge in English.
.
We offer:
Full contract for Ph.D. student for three years with possibility of renewal
Opportunity to do applied research to medical problems within a highly dynamic research institution (LCSB) and in collaboration with internationally recognized partners
An exciting international environment
A very competitive salary

For further information, please contact:

Prof. Dr. Antonio del Sol
E-mail: antonio.delsol@uni.lu

Applications should contain the following documents:
A detailed curriculum vitae
cover letter mentioning the reference number
description of past research experience and future interests
name and addresses of three referees

All applications should be sent preferably in electronic version until December 31st, 2013 to the following address:

Luxembourg Centre for Systems Biomedicine (LCSB)
University of Luxembourg
7, avenue des Hauts-Fourneaux
L-4362 Esch-sur-Alzette
Tel: +352-466644-6982 (Office)
Email: antonio.delsol@uni.lu
http://www.lcsb.lu

Address of the bookmark: https://github.com/ryanmelnyk/PyParanoid

Duration: 1 year

Funding Source: Institutional
Salary on grant: B2 (€ 22.000/year gross)
Contact Person (Referent): Tommaso Mazza
Ref. E-Mail: t.mazza@css-mendel.it
Tel: +39 06 44160526
Fax: +39 06 44160548

Job Description: The bioinformatics unit at IRCCS Casa Sollievo della Sofferenza - Mendel laboratory in Rome is looking for one young PhD bioinformatician with specific experience and/or interest in the analysis of transcriptomic data.

The candidate will be mainly in charge of developing research on a range of hot applications and projects, dealing with microarrays, RNA-Seq and miRNA-Seq data. Main activities will be: (i) data analysis (short-reads mapping, variants call and annotation, functional enrichment analysis of gene expression data); (ii) networks analysis and simulation (artificial knockout, redundancy and lethality analysis, gene set essentiality); (iii) developing of ad-hoc software solutions/routines on clusters of CPUs and GPUs.

The correct cultural background (training in Biology / Computer Science / Statistics or a mix of the three) and a strong interest in working with high throughput data analysis will be considered at the same level of specific experience in the above-mentioned fields.
Knowledge of molecular modeling and simulation and one of these languages: python, perl, R, Java, C++, C# is a golden plus. Good knowledge of Scientific English will be positively evaluated for this position, together with good presentation and teamwork skills.

A CV with one professional reference, details on educational background and of the biological and/or bioinformatic and/or data analysis skills and experience should be sent by email for a preliminary selection to: Tommaso Mazza, CSS-Mendel: t.mazza@css-mendel.it

Context
Casa Sollievo della Sofferenza is an Institute for hospitalization, care, and scientific research located in San Giovanni Rotondo, Italy. It integrates clinical assistance (with inpatient and outpatient facilities) and research. It has an affiliate institute, CSS-Mendel, located in Rome. Between the two sites, it employs over 100 researchers who focus on genetics. The Center is equipped with state of the art genomics technology (SOLiD 5500XL next generation sequencer, Illumina MiSeq, Affymetrix/Agilent microarray platforms, etc) as well as a dedicated high performance computing facility, a non-conventional workstation of GPUs and a short- and long-term storage disk.

Applications
Candidates should send:
• a cover letter explaining the role they would like to undertake within the Center, even if it is not listed in this job adv, stating clearly why they would be a good fit to the proposed role, and what they would bring to the Center in terms of expertise, ideas, talent;
• a CV including a list of publications;
• List of referees;

More at http://www.css-mendel.it/

• Freyman, W.A., Johnson, M.G., and C.J. Rothfels. 2022. Homologizer: phylogenetic phasing of gene copies into polyploid subgenomes. bioRxiv 2020.10.22.351486v4

homologizer is implemented in RevBayes. Please see http://revbayes.com to download and install RevBayes. For users without previous RevBayes experience, we recommend the tutorials at http://revbayes.com.

Address of the bookmark: https://github.com/wf8/homologizer

1. Work to establish improved quantitative experimental assays (such as microarrays or differential in-gel electrophoresis) and
2. Development of modern computational methods (such as hierarchical probabilistic models or integration of heterogeneous data sources)

Lab page @ http://bioinf.boku.ac.at/