The Duplication-Loss Problem: Novel Algorithms Based on k-NNI Local Search

Abstract

The duplication-loss problem is to infer a species super tree from a collection of gene trees that are confounded by complex histories of gene duplication and loss events. The decision variant of this problem is NP-complete. The utility of this NP-hard problem for large-scale phylogenetic analyses has been largely limited by the high time complexity of existing heuristics. These heuristics aimed at solving it perform a stepwise search of all possible super trees, where each step is guided by an exact solution to an instance of a local search problem. A classical local search problem is the NNI local search problem, which is based on the nearest neighbor interchange operation. In this paper, we extend the NNI neighborhood to the k-NNI neighborhood, and provide novel algorithms for the k-NNI search problem. The algorithms not only significantly enlarge the search space of the NNI search problem but also improve the running time of the solution to the NNI local search problem. Hence, our improvements make the duplication-loss problem much more tractable for large-scale phylogenetic analyses.