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 first show that the general problem of drawing galled networks as DAGmaps is NP-complete. Next, we restrict our attention to galled trees and planar galled networks and present linear time algorithms for visualizing them as DAGmaps. Finally, we explore whether these graphs can be visualized using One-Dimensional DAGmaps.

中文翻译：

---

可视化系统进化网络的算法

我们研究了可视化系统发育网络的问题，该系统是生物学中生命之树的延伸。为了使用有限的空间获得清晰的可视化效果，我们使用了一种称为DAGmaps的空间填充可视化方法。在本文中，我们首先证明将Dalmaps映射为网络的一般问题是NP完全的。接下来，我们将注意力集中在胆大的树木和平面的胆大的网络上，并提出将它们可视化为DAGmap的线性时间算法。最后，我们探索是否可以使用一维DAGmap可视化这些图。