title: Exactly computing the parsimony scores on phylogenetic networks using dynamic programming.
abstract: Scoring a given phylogenetic network is the first step that is required in searching for the best evolutionary framework for a given dataset. Using the principle of maximum parsimony, we can score phylogenetic networks based on the minimum number of state changes across a subset of edges of the network for each character that are required for a given set of characters to realize the input states at the leaves of the networks. Two such subsets of edges of networks are interesting in light of studying evolutionary histories of datasets: (i) the set of all edges of the network, and (ii) the set of all edges of a spanning tree that minimizes the score. The problems of finding the parsimony scores under these two criteria define slightly different mathematical problems that are both NP-hard. In this article, we show that both problems, with scores generalized to adding substitution costs between states on the endpoints of the edges, can be solved exactly using dynamic programming. We show that our algorithms require O(m(p)k) storage at each vertex (per character), where k is the number of states the character can take, p is the number of reticulate vertices in the network, m = k for the problem with edge set (i), and m = 2 for the problem with edge set (ii). This establishes an O(nm(p)k(2)) algorithm for both the problems (n is the number of leaves in the network), which are extensions of Sankoff's algorithm for finding the parsimony scores for phylogenetic trees. We will discuss improvements in the complexities and show that for phylogenetic networks whose underlying undirected graphs have disjoint cycles, the storage at each vertex can be reduced to O(mk), thus making the algorithm polynomial for this class of networks. We will present some properties of the two approaches and guidance on choosing between the criteria, as well as traverse through the network space using either of the definitions. We show that our methodology provides an effective means to study a wide variety of datasets.
authors.affiliation: Division of Invertebrate Zoology and Richard Gilder Graduate School , American Museum of Natural History, New York, New York.
authors.forename: Lavanya
authors.initials: L
authors.lastname: Kannan
authors.forename: Ward C
authors.initials: WC
authors.lastname: Wheeler
mesh_terms: D000818:Animals; D001000:Ants / Q000235:genetics; D003198:Computer Simulation; D019143:Evolution, Molecular; D017344:Genes, Insect; D008957:Models, Genetic; D010802:Phylogeny; D012984:Software