12 Result(s)
-
Chapter
Efficient Boundary Values Generation in General Metric Spaces for Software Component Testing
One of the most classical and successful software testing strategies is that of testing boundary values in the input domain (Reid 1997). In this paper we introduce a notion of boundary values for a finite subs...
-
Chapter and Conference Paper
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
Extensions of the randomized tournaments techniques introduced in [6,7] to approximate solutions of 1-median and diameter computation of finite subsets of general metric spaces are proposed. In the linear algo...
-
Chapter
AntiClustAl: Multiple Sequence Alignment by Antipole Clustering
In this chapter, we present a new multiple sequence alignment algorithm called AntiClustAl. The method makes use of the commonly used idea of aligning homologous sequences belonging to classes generated by som...
-
Chapter and Conference Paper
BitCube: A Bottom-Up Cubing Engineering
Enhancing on line analytical processing through efficient cube computation plays a key role in Data Warehouse management. Hashing, grou** and mining techniques are commonly used to improve cube pre-computati...
-
Chapter and Conference Paper
MySQL Data Mining: Extending MySQL to Support Data Mining Primitives (Demo)
The development of predictive applications built on top of knowledge bases is rapidly growing, therefore database systems, especially the commercial ones, are boosting with native data mining analytical tools....
-
Chapter and Conference Paper
An Efficient Duplicate Record Detection Using q-Grams Array Inverted Index
Duplicate record detection is a crucial task for data cleaning process in data warehouse systems. Many approaches have been presented to address this problem: some of these rely on the accuracy of the resulted...
-
Chapter
Computational Approaches to RNAi and Gene Silencing
The discovery of small regulatory RNAs in the past few years has deeply changed the RNA molecular biology, revealing more complex pathways involved in the regulation of gene expression and in the defense of th...
-
Chapter
gLabTrie: A Data Structure for Motif Discovery with Constraints
Motif discovery is the problem of finding subgraphs of a network that appear surprisingly often. Each such subgraph may indicate a small-scale interaction feature in applications ranging from a genomic interac...
-
Article
Fast analytical methods for finding significant labeled graph motifs
Network motif discovery is the problem of finding subgraphs of a network that occur more frequently than expected, according to some reasonable null hypothesis. Such subgraphs may indicate small scale interact...
-
Article
Open AccessEstablish the expected number of induced motifs on unlabeled graphs through analytical models
Complex networks are usually characterized by the presence of small and recurrent patterns of interactions between nodes, called network motifs. These small modules can help to elucidate the structure and the ...
-
Article
Open AccessTemporalRI: subgraph isomorphism in temporal networks with multiple contacts
Temporal networks are graphs where each edge is associated with a timestamp denoting when two nodes interact. Temporal Subgraph Isomorphism (TSI) aims at retrieving all the subgraphs of a temporal network (cal...
-
Article
Open AccessNETME: on-the-fly knowledge network construction from biomedical literature
The rapidly increasing biological literature is a key resource to automatically extract and gain knowledge concerning biological elements and their relations. Knowledge Networks are helpful tools in the contex...
