Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...
Background: Some distance methods are among the most commonly used methods for reconstructing phylogenetic trees from sequence data. The input to a distance method is a distance m...
Abstract. Aggregation is an important building block of modern distributed applications, allowing the determination of meaningful properties (e.g. network size, total storage capac...
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
In the recent years several research efforts have focused on the concept of time granularity and its applications. A first stream of research investigated the mathematical model...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...