We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Abstract-- This paper introduces a generalization of the Gravitational Clustering Algorithm proposed by Gomez et all in [1]. First, it is extended in such a way that not only the G...