Wing-Kin Sung

TL;DR: The maximum agreement supertree problem (MASP) is proved to be NP-hard for any fixed k ≥ 3 when D is unrestricted, and also NP- hard forAny fixed D ≥ 2 when k is unrestricted even if each input tree is required to contain at most three leaves.

TL;DR: A deterministic method called ChromSDE is presented, which applies semi-definite programming techniques to find the best structure fitting the observed data and uses golden section search to finding the correct parameter for converting the contact frequency to spatial distance and is shown to be much more accurate and robust than existing methods.

TL;DR: This paper shows that even for k = O ( lg lg n), the authors can index A succinctly such that both query and update operations can be supported using the same time complexities, and the time for update becomes the worst-case time.

TL;DR: In insight into the 3D structural mechanism underlying HPV integration in cervical carcinogenesis, it is found that HPV-CCDC106 integration altered local chromosome architecture and hijacked an enhancer via 3D genome structure remodeling.

TL;DR: Two new efficient algorithms for inferring a phylogenetic network from a set of gene trees of arbitrary degrees named RGNet and RGNet are presented and it is shown that these methods outperform the other existing methods neighbor-joining, NeighborNet, and SpNet.