Kai Wang

• PhD
• Professor (Assistant) at Georgia Southern University

Let k denote an integer greater than 2, let G denote a k-partite graph, and let S denote the set of all maximal k-partite cliques in G. Several open questions concerning the computation of S are resolved. A straightforward and highly-scalable modification to the classic recursive backtracking approach of Bron and Kerbosch is first described and sho...

The scientific literature teems with clique-centric clustering strategies. In this paper we analyze one such method, the paraclique algorithm. Paraclique has found practical utility in a variety of application domains, and has been successfully employed to reduce the effects of noise. Nevertheless, its formal analysis and worst-case guarantees have...

Differential Shannon entropy (DSE) and differential coefficient of variation (DCV) are effective metrics for the study of gene expression data. They can serve to augment differential expression (DE), and be applied in numerous settings whenever one seeks to measure differences in variability rather than mere differences in magnitude. A general purp...

Functional genomics, the effort to understand the role of genomic elements in biological processes, has led to an avalanche of diverse experimental and semantic information defining associations between genes and various biological concepts across species and experimental paradigms. Integrating this rapidly expanding wealth of heterogeneous data, a...

As the size of available data sets grows, so too does the demand for efficient parallel algorithms that will yield the solution to complex combinatorial problems on graphs that may be too large to fit entirely in memory. In previous work, we have provided a set of out-of-core algorithms to solve one of the central examples of such a problem, maximu...

Differential expression has been a standard tool for analysing case-control transcriptomic data since the advent of microarray technology. It has proved invaluable in characterising the molecular mechanisms of disease. Nevertheless, the expression profile of a gene across samples can be perturbed in ways that leave the expression level unaltered, w...

We investigate the relative significance of kernelization versus branching for parallel FPT implementations. Using the well-known vertex cover problem as a familiar example, we build and experiment with a testbed of five different classes of difficult graphs. For some, we find that kernelization alone obviates the need for parallelism. For others,...

Secret sharing is important in information and network security and has broad applications in the real world. Since an elegant secret sharing mechanism was first proposed by Shamir in 1979, many schemes have appeared in literature. These schemes deal with either single or multiple secrets and their shares have either the same weight or different we...

Anonymity is an important feature in many two party communication systems. Its main meaning is that either the message sender or the receiver (or both) is unidentifiable to other users, even between themselves. Many mechanisms have been proposed to hide the identity of the sender, receiver, or both. Similarly, anonymity is an important feature in m...

Embedding user subscription time into cryptographic key generation and assignment for hierarchical access control has raised tremendous interest among researchers and practitioners in multicast, broadcast, and secure group communication fields. During the subscription period, a user of a higher class can compute the (time-bound) keys of his/her own...

Healthcare is an information intensive industry. Pervasive computing, as the third wave of computing technology and when applied to healthcare systems, could potentially revolutionize next generation medical applications and significantly improve the quality of healthcare services. Healthcare information is very sensitive and security, privacy, and...