The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
—Evidence shows that proposals for new modeling notations emerge and evolution of current ones are becoming more complex, often in an attempt to satisfy the many different modeli...
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
Abstract--Plenty of methods have been proposed in order to discover latent variables (features) in data sets. Such approaches include the principal component analysis (PCA), indepe...
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...