Wing-Kin Sung

TL;DR: Two new deterministic algorithms for constructing consensus trees with identical leaf label sets and n leaves each are presented, which are optimal since the input size is Ω(k n), and the second one constructs the frequency difference consensus tree in min {O (k n 2), O (k + log2 n) time.

TL;DR: The previously fastest algorithm for computing the rooted triplet distance between two input galled trees runs in \(O(n^{2.687})\) time, where n is the cardinality of the leaf label set.

TL;DR: This issue will discuss methods for analyzing and integrating omics datasets, and discusses recent methods for integrated analysis of protein-protein interaction data, metabolomics data, genomics and transcriptomics data.

TL;DR: This paper proposes an efficient algorithm to solve the 2-Interval pattern matching problem for {< , ⊂} -structured pattern and applies it on scanning for the ncRNAs without pseudoknots and shows that the method can result in much fewer false positives.

TL;DR: Wang et al. as mentioned in this paper developed a deep multiple instance learning model predicting tumor purity from H&E stained digital histopathology slides, which can be used for high throughput sample selection for genomic analysis, which will help reduce pathologists9 workload and decrease inter-observer variability.