4 citations · 5 across the 2 of their papers we have counts for
3 papers
q-bio.QM2018★ 1 cited
Fast Methods for Solving the Cluster Containment Problem for Phylogenetic Networks
Andreas D. M. Gunawan, Bingxin Lu, Louxin Zhang
Genetic and comparative genomic studies indicate that extant genomes are more properly considered to be a fusion product of random mutations over generations and genomic material t…
q-bio.PE2017★ 4 cited
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…
q-bio.PE2016
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…