Algorithms for Visualizing Phylogenetic Networks
Ioannis G. Tollis, Konstantinos G. Kakoulis

TL;DR
This paper introduces linear time algorithms for visualizing galled trees and networks as DAGmaps, enhancing clarity and space efficiency in phylogenetic network visualization.
Contribution
It presents the first linear time algorithms for DAGmap visualization of galled phylogenetic networks, improving visualization efficiency.
Findings
Linear time algorithms for galled tree visualization as DAGmaps
Enhanced clarity and space efficiency in phylogenetic network visualization
Applicable to biological data visualization tasks
Abstract
We study the problem of visualizing phylogenetic networks, which are extensions of the Tree of Life in biology. We use a space filling visualization method, called DAGmaps, in order to obtain clear visualizations using limited space. In this paper, we restrict our attention to galled trees and galled networks and present linear time algorithms for visualizing them as DAGmaps.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
