We consider the problem of inferring the structure of a network from cooccurrence data: observations that indicate which nodes occur in a signaling pathway but do not directly reveal node order within the pathway. This problem is motivated by network inference problems arising in computational biology and communication systems, in which it is difficult or impossible to obtain precise time order...

Virologists are not only interested in point mutations in a genome, but also in relationships between mutations. In this work, we present a design study to support the discovery of correlated mutation events (called co-occurrences) in populations of viral genomes. The key challenge is to identify potentially interesting pairs of events within the vast space of event combinations. In our work, w...

In this paper, we study pattern matching conditions in the cycle structures of permutations. We develop methods to find the joint distribution of the number of cycles and the number of cycle descents over the set of permutations in the symmetric group Sn which have no cycle occurrences or no consecutive cycle occurrences of a given pattern or set of patterns. Our methods also allow us to refine...

Drug abuse is one of the highest occurrences of diseases globally, with increased cases of mental health, physical health and death problems. Drug control counselling centres and drug law enforcement agencies have made several efforts by implementing drug prohibition policies, campaign against drug abuse and creating awareness on risks associated with drug abuse. Unfortunately, drug abuse has b...

0167-8655/$ see front matter 2012 Elsevier B.V. A http://dx.doi.org/10.1016/j.patrec.2012.12.003 ⇑ Corresponding author. Tel.: +39 0382 985358; fax E-mail addresses: [email protected] (V uniparthenope.it (A. Ferone), [email protected] (O. uniparthenope.it (A. Petrosino). This paper describes a new approach to the analysis of protein 3D structure based on the Secondary Structure (SS) re...

In this paper we introduce the well distributed occurrences (WDO) combinatorial property for infinite words, which guarantees good behavior (no lattice structure) in some related pseudorandom number generators. An infinite word u on a d-ary alphabet has the WDO property if, for each factor w of u, positive integer m, and vector v ∈ Zm, there is an occurrence of w such that the Parikh vector of ...

The search for first occurrences of prime gaps and maximal prime gaps is extended to 1015. New maximal prime gaps of 806 and 906 are found, and sixty-two previously unpublished first occurrences are found for gaps varying from 676 to 906.