Search Results for author:
Found 9 papers, 2 papers with code
Drugst.One -- A plug-and-play solution for online systems medicine and network-based drug repurposing
In recent decades, the development of new drugs has become increasingly expensive and inefficient, and the molecular mechanisms of most pharmaceuticals remain poorly understood.
Federated singular value decomposition for high dimensional data
Federated learning (FL) is emerging as a privacy-aware alternative to classical cloud-based machine learning.
The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version]
The inference of minimum spanning arborescences within a set of objects is a general problem which translates into numerous application-specific unsupervised learning tasks.
Federated Multi-Mini-Batch: An Efficient Training Approach to Federated Learning in Non-IID Environments
Federated learning has faced performance and network communication challenges, especially in the environments where the data is not independent and identically distributed (IID) across the clients.
Flimma: a federated and privacy-preserving tool for differential gene expression analysis
Aggregating transcriptomics data across hospitals can increase sensitivity and robustness of differential expression analyses, yielding deeper clinical insights.
Privacy-preserving Artificial Intelligence Techniques in Biomedicine
Artificial intelligence (AI) has been successfully applied in numerous scientific domains.
Exploring the SARS-CoV-2 virus-host-drug interactome for drug repurposing
The web interface allows user-friendly visual exploration of the virus-host interactome and implements systems medicine algorithms for network-based prediction of drugs.
New Techniques for Graph Edit Distance Computation
LSAPE is a generalization of the well-known linear sum assignment problem (LSAP), and has to be solved as a subproblem by many GED algorithms.
Improved local search for graph edit distance
Among different classes of heuristic algorithms that were proposed to compute approximate solutions, local search based algorithms provide the tightest upper bounds for GED.
