Lars Arvestad: A scalable NJ-like heuristic for phylogeny inference

Abstract

I will discuss the problem of inferring evolutionary trees, phylogenies, and present a heuristic that is scalable, practical, and easy to implement. The heuristic has been implemented and results from some computational experiments on both simulated and biological data will be presented.