Medical Research Council, Harwell Featured PhD Programmes
University College London Featured PhD Programmes
University of Glasgow Featured PhD Programmes
University of East Anglia Featured PhD Programmes
University of Manchester Featured PhD Programmes

Accelerating molecular phylogenetic inference using high performance computing.

This project is no longer listed in the FindAPhD
database and may not be available.

Click here to search the FindAPhD database
for PhD studentship opportunities
  • Full or part time
    Dr A Meade
  • Application Deadline
    Applications accepted all year round
  • Self-Funded PhD Students Only
    Self-Funded PhD Students Only

About This PhD Project

Project Description

Molecular phylogenetic inference, constructing evolutionary histories from molecular data, is an activity universal to all biological disciplines. Phylogenetic inference is an essential analytical technique used in almost all areas of biology from virology and immunology, to protein evolution, from protein networks to evaluating extinction risks and from organismal studies to the analysis of gene evolution. The use of molecular phylogenies in the literature has grown rapidly over the past 10 years. The volume of molecular data has grown nearly exponentially, due to a roughly 50,000 fold reduction in sequencing costs. During the same time period the accuracy and complexity of analytical models has increased. The volume of data and increase in model complexity far exceed advances in computing power. This has created a widening gap between data sets and methods researchers would like to use and available computing power and scalable software. While there are currently a number of methods to scale phylogenetic inference tools, they tend to only be effective up to hundreds of cores.
This project will develop highly scalable algorithms for molecular phylogenetic inference, using a range of techniques, including parallelisation of existing methods, development of highly scalable algorithms and GPU acceleration.

FindAPhD. Copyright 2005-2018
All rights reserved.

Let us know you agree to cookies

We use cookies to give you the best online experience. By continuing, we'll assume that you're happy to receive all cookies on this website. To read our privacy policy click here