A Graph-Based Similarity Approach to Classify Recurrent Complex Motifs from Their Context in RNA Structures

To answer a relaxed instance query is to compute for a given concept C, a CSM ∼, and a threshold t between 0 and 1, a set of concepts such that each of these concepts are similar to

In this paper we address the two mentioned problems by proposing a representation of the notions underlying the SemSim semantic similarity method [2], according to

The notion of pervasive/ubiquitous computing refers to user-centric pro- visionning of services and applications that are adaptive to user preferences and monitored conditions,

As in the case of the weighted Shapley value, the coalition structure modifies the probability of the different orders defined on the set of players.. But in their definition of

The void contraction (motion of its boundary to- wards the center) corresponds to a strong enhancement of the plasma emission in the void region [23].. On the contrary, the

In connection with all this, another problem arises: to use the developed method of comparative evaluation of algorithms for calculating distances between sequences for a

Our parallel implementation works better in larger datasets with size greater than 10 5 pairs. It is also the key to developing systems for Record Linkage and Link Discovery

We used stratified 100-fold Monte Carlo cross-validation with 70%/30% train- ing/testing splitting of the data, as follows: (i) randomly split the data set samples into 70% training