DeepAI AI Chat
Log In Sign Up

Covering Tree-Based Phylogenetic Networks

by   Nathan Davidov, et al.

Tree-based phylogenetic networks, which may be roughly defined as leaf-labeled networks built by adding arcs only between the original tree edges, have elegant properties for modeling evolutionary histories. We answer an open question of Francis, Semple, and Steel about the complexity of determining how far a phylogenetic network is from being tree-based, including non-binary phylogenetic networks. We show that finding a phylogenetic tree covering the maximum number of nodes in a phylogenetic network can be be computed in polynomial time via an encoding into a minimum-cost maximum flow problem.


page 1

page 2

page 3

page 4


Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

In phylogenetics, tree-based networks are used to model and visualize th...

A Cost-Scaling Algorithm for Minimum-Cost Node-Capacitated Multiflow Problem

In this paper, we address the minimum-cost node-capacitated multiflow pr...

A QUBO formulation for the Tree Containment problem

Phylogenetic (evolutionary) trees and networks are leaf-labeled graphs t...

Orienting undirected phylogenetic networks to tree-child network

Phylogenetic networks are used to represent the evolutionary history of ...

Robust capacitated trees and networks with uniform demands

We are interested in the design of robust (or resilient) capacitated roo...

An algorithm for reconstructing level-2 phylogenetic networks from trinets

Evolutionary histories for species that cross with one another or exchan...