Wing-Kin Sung

TL;DR: A new decomposition theorem for maximum weight bipartite matchings is presented and used to design an O(?nW)-time algorithm for computing a maximum weight matching of G, which bridges a long-standing gap between the best known time complexity of computing amaximum weight matching and that of Computing a maximum cardinality matching.

TL;DR: Based on the new algorithm, optimal short (20 bases) or long (50 or 70 bases) probes can be computed efficiently for large genomes and some smart filtering techniques are used to avoid redundant computation while maintaining the accuracy.

TL;DR: The orthologous analysis on those gene families associated with animal cold tolerance provided the first genomic evidence revealing specific cold‐tolerant strategies in C. suppressalis, including those involved in glucose‐originated glycerol biosynthesis, triacylglycerol‐originate glycerolsynthesis, fatty acid synthesis and trehalose transport‐intermediate cold tolerance.

TL;DR: A well-studied case in which T is fixed and preprocessed into an indexing data structure so that any pattern query can be answered faster is investigated, which allows us to exploit compressed suffix arrays to reduce the indexing space to O(n) bits, while increasing the query time by an O(log n) factor only.

TL;DR: A novel framework to profile long-range chromatin interactions associated with AR and its collaborative transcription factor, erythroblast transformation-specific related gene (ERG), using chromatin interaction analysis by paired-end tag (ChIA-PET).