We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storag...
Nowadays, the number of protein sequences being stored in central protein databases from labs all over the world is constantly increasing. From these proteins only a fraction has b...
Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by n...
In this work we examined the performance of two evolutionary algorithms, a genetic algorithm (GA) and particle swarm optimization (PSO), in the estimation of the parameters of a mo...
Dulce Calcada, Agostinho Rosa, Luis C. Duarte, Vit...