Wing-Kin Sung

TL;DR: It is proved that a special case of the local gapped subforest alignment problem is equivalent to a problem known in the literature as the local sequence-structure alignment problem (lssa) and the main algorithm is modified to obtain a much faster algorithm for lssa than the one previously proposed.

TL;DR: D5F3 immunohistochemistry, single-color CISH and IT-PGM sequencing are suitable assays for evaluation of ALK status in future neuroblastoma clinical trials, and correlation with ALK genomic and hotspot mutational status revealed that the majority of D5F2 ALK-positive cases did not possess either ALK genomes or hotspot mutations.

TL;DR: An algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees that takes O(n1.5 log n) time for trees with unbounded degrees, matching the best known time complexity for the rooted case.

TL;DR: This paper focuses on predicting RNA secondary structures with a maximum number of stacking pairs and obtains two approximation algorithms with worst-case approximation ratios of 1/2 and 1/3 for planar and general secondary structures, respectively.

TL;DR: It is proved that the general case of MASN is NP-hard already for two phylogenetic networks, but that the problem can be solved efficiently if the two given phylogenetics networks exhibit a nested structure.