Wing-Kin Sung

TL;DR: An O(n) time algorithm is given for comparing galled-trees, which are an important, biological meaningful special case of phylogenetic network, and an $$O(n + kh)$$-time algorithm for comparing a galling-tree with another general network, where h and k are the number of hybrid nodes in the latter network and its biggest biconnected component respectively.

TL;DR: Zeng et al. as mentioned in this paper developed a method for accurate detection of virus integration into host genomes, which is a significant upgrade of HIVID and performs a paired-end combination (PE-combination) for potentially integrated reads.

TL;DR: This work proposes a method called D-SLIMMER to mine for SLiMs in PPI data on the basis of the interaction density between a nonlinear motif in one protein and a SLiM in the other protein, and shows that D- SLIMMER outperformed existing methods notably for discovering domain-SLiMs interaction motifs.

TL;DR: A novel caller, SurVIndel, which focuses on detecting deletions and tandem duplications from paired next-generation sequencing data and outperforms existing methods on both simulated and real biological datasets.

TL;DR: This study focuses on one of the most frequently used consensus tree problems, called greedy consensus tree problem, and describes an O(k^2 n) time solution, which is the fastest when k = O(\sqrt{n} \log n)\).