Seguir
Andreas D. M. Gunawan
Andreas D. M. Gunawan
Dirección de correo verificada de u.nus.edu
Título
Citado por
Citado por
Año
Locating a tree in a phylogenetic network in quadratic time
P Gambette, ADM Gunawan, A Labarre, S Vialette, L Zhang
Research in Computational Molecular Biology: 19th Annual International …, 2015
382015
A decomposition theorem and two algorithms for reticulation-visible networks
ADM Gunawan, B DasGupta, L Zhang
Information and Computation 252, 161-175, 2017
362017
A program for verification of phylogenetic network models
ADM Gunawan, B Lu, L Zhang
Bioinformatics 32 (17), i503-i510, 2016
242016
Solving the tree containment problem in linear time for nearly stable phylogenetic networks
P Gambette, ADM Gunawan, A Labarre, S Vialette, L Zhang
Discrete Applied Mathematics 246, 62-79, 2018
192018
Counting and enumerating galled networks
ADM Gunawan, J Rathin, L Zhang
Discrete Applied Mathematics 283, 644-654, 2020
172020
Solving the tree containment problem for genetically stable networks in quadratic time
P Gambette, ADM Gunawan, A Labarre, S Vialette, L Zhang
Combinatorial Algorithms: 26th International Workshop, IWOCA 2015, Verona …, 2016
152016
Locating a tree in a reticulation-visible network in cubic time
ADM Gunawan, B DasGupta, L Zhang
arXiv preprint arXiv:1507.02119, 2015
122015
Solving the tree containment problem for reticulation-visible networks in linear time
ADM Gunawan
Algorithms for Computational Biology: 5th International Conference, AlCoB …, 2018
102018
Compression of phylogenetic networks and algorithm for the tree containment problem
ADM Gunawan, H Yan, L Zhang
Journal of Computational Biology 26 (3), 285-294, 2019
82019
S-Cluster++: a fast program for solving the cluster containment problem for phylogenetic networks
H Yan, ADM Gunawan, L Zhang
Bioinformatics 34 (17), i680-i686, 2018
72018
Solving tree containment problem for reticulation-visible networks with optimal running time
A Gunawan
arXiv preprint arXiv:1702.04088, 2017
72017
Fast methods for solving the cluster containment problem for phylogenetic networks
ADM Gunawan, B Lu, L Zhang
arXiv preprint arXiv:1801.04498, 2018
52018
Locating a phylogenetic tree in a reticulation-visible network in quadratic time
ADM Gunawan, B DasGupta, L Zhang
arXiv preprint arXiv:1603.08655, 2016
22016
Bounding the size of a network defined by visibility property
ADM Gunawan, L Zhang
arXiv preprint arXiv:1510.00115, 2015
22015
Stability implies computational tractability: Locating a tree in a stable network is easy
ADM Gunawan, B DasGupta, L Zhang
arXiv preprint arXiv:1507.02119, 2015
22015
The compressions of reticulation-visible networks are tree-child
ADM Gunawan, H Yan, L Zhang
arXiv preprint arXiv:1806.07625, 2018
2018
On the Tree and Cluster Containment Problems for Phylogenetic Networks
ADM Gunawan
PQDT-Global, 2018
2018
The Nk-valued Roman Domination and Its Boundaries
ADM Gunawan, KM Koh
Electronic Notes in Discrete Mathematics 48, 95-102, 2015
2015
Some Generalizations on Roman Domination
ADM Gunawan
National University of Singapore, 2013
2013
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–19