A program to compute the soft Robinson-Foulds distance between phylogenetic networks.

ABSTRACT:

Background

Over the past two decades, phylogenetic networks have been studied to model reticulate evolutionary events. The relationships among phylogenetic networks, phylogenetic trees and clusters serve as the basis for reconstruction and comparison of phylogenetic networks. To understand these relationships, two problems are raised: the tree containment problem, which asks whether a phylogenetic tree is displayed in a phylogenetic network, and the cluster containment problem, which asks whether a cluster is represented at a node in a phylogenetic network. Both the problems are NP-complete.

Results

A fast exponential-time algorithm for the cluster containment problem on arbitrary networks is developed and implemented in C. The resulting program is further extended into a co

SUBMITTER: Lu B 

PROVIDER: S-EPMC5374702 | biostudies-literature | 2017 Mar

REPOSITORIES: biostudies-literature