A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the ...
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
Abstract. The rapidly emerging field of metagenomics seeks to examine the genomic content of communities of organisms to understand their roles and interactions in an ecosystem. I...
Gianluigi Folino, Fabio Gori, Mike S. M. Jetten, E...
A new design method for Cellular automata (CA) rules are described. We have already proposed a method for designing the transition rules of two-dimensional 256-state CA for graysca...
Background: A multiple sequence alignment (MSA) generated for a protein can be used to characterise residues by means of a statistical analysis of single columns. In addition to t...