We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
Background: Algorithms and software for CNV detection have been developed, but they detect the CNV regions sample-by-sample with individual-specific breakpoints, while common CNV ...
Teo Shu Mei, Agus Salim, Stefano Calza, Ku Chee Se...
Background: The most common substitution matrices currently used (BLOSUM and PAM) are based on protein sequences with average amino acid distributions, thus they do not represent ...
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Background: There are currently many different methods for processing and summarizing probelevel data from Affymetrix oligonucleotide arrays. It is of great interest to validate t...
Li-Xuan Qin, Richard P. Beyer, Francesca N. Hudson...