David B. Blumenthal

Orcid: 0000-0001-8651-750X

According to our database1, David B. Blumenthal authored at least 48 papers between 2017 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
How Meta-research Can Pave the Road Towards Trustworthy AI In Healthcare: Catalogue of Ideas and Roadmap for Future Research.
CoRR, March, 2026

2025
NApy: Efficient Statistics in Python for Large-Scale Heterogeneous Data with Enhanced Support for Missing Data.
CoRR, May, 2025

Cellular morphodynamics as quantifiers for functional states of resident tissue macrophages in vivo.
PLoS Comput. Biol., 2025

Deep learning models for unbiased sequence-based PPI prediction plateau at an accuracy of 0.65.
Bioinform., 2025

Inference of differential kinase interaction networks with KINference.
Bioinform., 2025

Gene Co-expression Networks are Poor Proxies for Expert-Curated Gene Regulatory Networks.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2025

2024
Federated singular value decomposition for high-dimensional data.
Data Min. Knowl. Discov., May, 2024

Cracking the black box of deep sequence-based protein-protein interaction prediction.
Briefings Bioinform., March, 2024

UnPaSt: unsupervised patient stratification by differentially expressed biclusters in omics data.
CoRR, 2024

A Differentiable Approximation of the Graph Edit Distance.
Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2024

NeDRex-Web: An Interactive Web Tool for Drug Repurposing by Exploring Heterogeneous Molecular Networks.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2024

2023
On the role of network topology in German-Jewish recommendation letter networks in the early twentieth century.
Appl. Netw. Sci., December, 2023

Demographic confounders distort inference of gene regulatory and gene co-expression networks in cancer.
Briefings Bioinform., September, 2023

The edge-preservation similarity for comparing rooted, unordered, node-labeled trees.
Pattern Recognit. Lett., March, 2023

Online bias-aware disease module mining with ROBUST-Web.
Bioinform., 2023

2022
Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching.
Inf. Sci., 2022

Robust disease module mining via enumeration of diverse prize-collecting Steiner trees.
Bioinform., 2022

Online <i>in silico</i> validation of disease and gene sets, clusterings or subnetworks with DIGEST.
Briefings Bioinform., 2022

Querying Temporal Anomalies in Healthcare Information Systems and Beyond.
Proceedings of the Advances in Databases and Information Systems, 2022

2021
Scalable generalized median graph estimation and its manifold use in bioinformatics, clustering, classification, and indexing.
Inf. Syst., 2021

Upper Bounding Graph Edit Distance Based on Rings and Machine Learning.
Int. J. Pattern Recognit. Artif. Intell., 2021

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections [Extended Version].
CoRR, 2021

BiCoN: network-constrained biclustering of patients and omics data.
Bioinform., 2021

A framework for modeling epistatic interaction.
Bioinform., 2021

On the limits of active module identification.
Briefings Bioinform., 2021

The Minimum Edit Arborescence Problem and Its Use in Compressing Graph Collections.
Proceedings of the Similarity Search and Applications - 14th International Conference, 2021

Metric Indexing for Graph Similarity Search.
Proceedings of the Similarity Search and Applications - 14th International Conference, 2021

On the Privacy of Federated Pipelines.
Proceedings of the SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021

Federated Principal Component Analysis for Genome-Wide Association Studies.
Proceedings of the IEEE International Conference on Data Mining, 2021

2020
Finding k-shortest paths with limited overlap.
VLDB J., 2020

Comparing heuristics for graph edit distance computation.
VLDB J., 2020

What is meaningful research and how should we measure it?
Scientometrics, 2020

Fast linear sum assignment with error-correction and no cost constraints.
Pattern Recognit. Lett., 2020

Improved local search for graph edit distance.
Pattern Recognit. Lett., 2020

On the exact computation of the graph edit distance.
Pattern Recognit. Lett., 2020

Federated Multi-Mini-Batch: An Efficient Training Approach to Federated Learning in Non-IID Environments.
CoRR, 2020

Privacy-preserving Artificial Intelligence Techniques in Biomedicine.
CoRR, 2020

EpiGEN: an epistasis simulation pipeline.
Bioinform., 2020

2019
New Techniques for Graph Edit Distance Computation.
CoRR, 2019

Upper Bounding GED via Transformations to LSAPE Based on Rings and Machine Learning.
CoRR, 2019

GEDLIB: A C++ Library for Graph Edit Distance Computation.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2019

2018
Improved Lower Bounds for Graph Edit Distance.
IEEE Trans. Knowl. Data Eng., 2018

Finding k-Dissimilar Paths with Minimum Collective Length.
CoRR, 2018

Ring Based Approximation of Graph Edit Distance.
Proceedings of the Structural, Syntactic, and Statistical Pattern Recognition, 2018

Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem.
Proceedings of the 24th International Conference on Pattern Recognition, 2018

Finding <i>k</i>-dissimilar paths with minimum collective length.
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2018

2017
Correcting and Speeding-Up Bounds for Non-Uniform Graph Edit Distance.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs.
Proceedings of the Graph-Based Representations in Pattern Recognition, 2017


  Loading...