Algorithms for visualizing phylogenetic networks

DOI10.1016/j.tcs.2020.05.047zbMath1452.68142arXiv1609.00755OpenAlexW3035065670MaRDI QIDQ2192379

Konstantinos G. Kakoulis, Ioannis. G. Tollis

Publication date: 17 August 2020

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.00755

zbMATH Keywords

phylogenetic networkgalled treegalled networkDAGmapstreemaps

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Some problems related to the space of optimal tree reconciliations (invited talk) ⋮ Upward planar drawings with two slopes ⋮ Visualizing multispecies coalescent trees: drawing gene trees inside species trees ⋮ Visualizing co-phylogenetic reconciliations ⋮ Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings

Cites Work

• Unnamed Item
• Unnamed Item
• Seeing the trees and their branches in the network is hard
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• Visualizing co-phylogenetic reconciliations
• Computing the rooted triplet distance between galled trees by counting triangles
• DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations
• DAGmaps: Space Filling Visualization of Directed Acyclic Graphs
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network

This page was built for publication: Algorithms for visualizing phylogenetic networks