DeepAI AI Chat
Log In Sign Up

Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

by   Jonathan Klawitter, et al.

In phylogenetics, tree-based networks are used to model and visualize the evolutionary history of species where reticulate events such as horizontal gene transfer have occurred. Formally, a tree-based network N consists of a phylogenetic tree T (a rooted, binary, leaf-labeled tree) and so-called reticulation edges that span between edges of T. The network N is typically visualized by drawing T downward and planar and reticulation edges with one of several different styles. One aesthetic criteria is to minimize the number of crossings between tree edges and reticulation edges. This optimization problem has not yet been researched. We show that, if reticulation edges are drawn x-monotone, the problem is NP-complete, but fixed-parameter tractable in the number of reticulation edges. If, on the other hand, reticulation edges are drawn like "ears", the crossing minimization problem can be solved in quadratic time.


page 1

page 2

page 3

page 4


Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees

We consider the problem of drawing multiple gene trees inside a single s...

A QUBO formulation for the Tree Containment problem

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

Covering Tree-Based Phylogenetic Networks

Tree-based phylogenetic networks, which may be roughly defined as leaf-l...

The Tree Stabbing Number is not Monotone

Let P ⊆ℝ^2 be a set of points and T be a spanning tree of P. The stabbin...

Crossing Minimization in Perturbed Drawings

Due to data compression or low resolution, nearby vertices and edges of ...

On the number of edges of separated multigraphs

We prove that the number of edges of a multigraph G with n vertices is a...

Block Crossings in One-Sided Tanglegrams

Tanglegrams are drawings of two rooted binary phylogenetic trees and a m...