In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
The reconstruction of objects from data in practical applications often leads to surfaces with small perturbations and other artifacts which make the detection of their ridges and...
Frederic F. Leymarie, Benjamin B. Kimia, Peter J. ...
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...