Work

Parallel likelihood calculations for phylogenetic trees

Year: 2011
Type: dissertation
Abstract: Phylogenetic analysis is the study of evolutionary relationships among organisms.To this end, phylogenetic trees, or evolutionary trees, are used to depict the evolutionary relationships between organisms as reconstructed from DNA sequence data.The likelihood of a given tree is commonly calculated for many purposes including inferring phylogenies, sampling from the space of likely trees and inferring other parameters governing the evolutionary process.This is done using Felsenstein's algorithm, a widely implemented dynamic programming approach that reduces the computational complexity from exponential to linear in the number of taxa.However, with the advent of efficient modern sequencing techniques the size of data sets are rapidly increasing beyond current computational capability.Parallel computing has been used successfully to address many similar problems and is currently receiving attention in the realm of phylogenetic analysis.Work has been done using data decomposition, where the likelihood calculation is parallelised over DNA sequence sites.We propose an alternative way of parallelising the likelihood calculation, which we call segmentation, where the tree is broken down into subtrees and the likelihood of each subtree is calculated concurrently over multiple processes.We introduce our proposed system, which aims to drastically increase the size of trees that can be practically used in phylogenetic analysis.Then, we evaluate the system on large phylogenies which are constructed from both real and synthetic data, to show that a larger decrease of run times are obtained when the system is used.
Language: English
Open Access status: green
OpenAlex ID: W2147905700
Cites: 56
Cited by:
Related to: 10