34 citations · 68 across the 8 of their papers we have counts for
5 papers · 1 filter
Counting and Enumerating Galled Networks
Andreas DM Gunawan, Jeyaram Rathin, Louxin Zhang
Galled trees are widely studied as a recombination model in population genetics. This class of phylogenetic networks is generalized into galled networks by relaxing a structural co…
Solving Tree Containment Problem for Reticulation-visible Networks with Optimal Running Time
Andreas Gunawan
Tree containment problem is a fundamental problem in phylogenetic study, as it is used to verify a network model. It asks whether a given network contain a subtree that resembles a…
Locating a Phylogenetic Tree in a Reticulation-Visible Network in Quadratic Time
Andreas DM Gunawan, Bhaskar DasGupta, Louxin Zhang
In phylogenetics, phylogenetic trees are rooted binary trees, whereas phylogenetic networks are rooted arbitrary acyclic digraphs. Edges are directed away from the root and leaves…
Bounding the Size of a Network Defined By Visibility Property
Andreas D. M. Gunawan, Louxin Zhang
Phylogenetic networks are mathematical structures for modeling and visualization of reticulation processes in the study of evolution. Galled networks, reticulation visible networks…
Locating a Tree in a Reticulation-Visible Network in Cubic Time
Andreas D. M. Gunawan, Bhaskar DasGupta, Louxin Zhang
In this work, we answer an open problem in the study of phylogenetic networks. Phylogenetic trees are rooted binary trees in which all edges are directed away from the root, wherea…