Gundolf Schenk

dblp:95/7244 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2023
0000-0003-1240-9949ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 75% Medical and health informatics · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 50% Data mining · 50%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › data integration
biomedical data integration
0.712023
The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information · Bioinform. 2023
Bioinformatics and computational biology › knowledge representation in biology
biomedical knowledge graph
0.712023
The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information · Bioinform. 2023
Bioinformatics and computational biology
knowledge graph
0.712023
The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information · Bioinform. 2023
Medical and health informatics
precision medicine
0.712023
The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information · Bioinform. 2023
Parallel and multicore computing › parallel algorithms › graph algorithms
all-pairs shortest paths
0.612022
Exaflops Biomedical Knowledge Graph Analytics · SC 2022
Parallel and multicore computing
graph processing
0.612022
Exaflops Biomedical Knowledge Graph Analytics · SC 2022
Knowledge graphs › domain-specific knowledge graph
biomedical knowledge graph
0.212022
Exaflops Biomedical Knowledge Graph Analytics · SC 2022
Data mining › structured data mining
relational data mining
0.212022
Exaflops Biomedical Knowledge Graph Analytics · SC 2022

Methods — techniques the papers use, named apart from their topics

tropical semiring · 1.1hyperbolic performance modeling · 1.1ontology-based integration · 0.7REST API · 0.7
YearPublicationVenuePosition
2023 The scalable precision medicine open knowledge engine (SPOKE): a massive knowledge graph of biomedical information
abstract
MOTIVATION: Knowledge graphs (KGs) are being adopted in industry, commerce and academia. Biomedical KG presents a challenge due to the complexity, size and heterogeneity of the underlying information. RESULTS: In this work, we present the Scalable Precision Medicine Open Knowledge Engine (SPOKE), a biomedical KG connecting millions of concepts via semantically meaningful relationships. SPOKE contains 27 million nodes of 21 different types and 53 million edges of 55 types downloaded from 41 databases. The graph is built on the framework of 11 ontologies that maintain its structure, enable mappings and facilitate navigation. SPOKE is built weekly by python scripts which download each resource, check for integrity and completeness, and then create a 'parent table' of nodes and edges. Graph queries are translated by a REST API and users can submit searches directly via an API or a graphical user interface. Conclusions/Significance: SPOKE enables the integration of seemingly disparate information to support precision medicine efforts. AVAILABILITY AND IMPLEMENTATION: The SPOKE neighborhood explorer is available at https://spoke.rbvi.ucsf.edu. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
John Scotter Morris, Karthik Soman, Rabia E. Akbas, Xiaoyuan Zhou, Brett Smith, Elaine C. Meng, Conrad C. Huang, Gabriel Cerono, Gundolf Schenk, Angela Rizk-Jackson, Adil Harroud, Lauren M. Sanders, Sylvain V. Costes, Krish Bharat, Arjun Chakraborty, Alexander R. Pico, Taline Mardirossian, Michael J. Keiser, Alice Tang, Josef Hardi, Yongmei Shi, Mark A. Musen, Sharat Israni, Sui Huang, Peter W. Rose, Charlotte A. Nelson, Sergio Baranzini
Bioinform.9
2022 Deidentifying a Corpus of 100 Million Clinical Text Documents for Information Extraction: Lessons Learned
Lakshmi Radhakrishnan, Gundolf Schenk, Kathlene Muenzen, Boris Oskotsky, Sharat Israni, Atul J. Butte
AMIA2
2022 Exaflops Biomedical Knowledge Graph Analytics
abstract
We are motivated by newly proposed methods for mining large-scale corpora of scholarly publications (e.g., full biomedical literature), which consists of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover relationships among concepts. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as an all-pairs shortest paths (APSP) and validate connective paths against curated biomedical knowledge graphs (e.g., Spoke). In this context, we present Coast (Exascale Communication-Optimized All-Pairs Shortest Path) and demonstrate 1.004 EF/s on 9,200 Frontier nodes (73,600 GCDs). We develop hyperbolic performance models (HYPERMOD), which guide optimizations and parametric tuning. The proposed Coast algorithm achieved the memory constant parallel efficiency of 99% in the single-precision tropical semiring. Looking forward, Coast will enable the integration of scholarly corpora like PubMed into the Spoke biomedical knowledge graph.
Ramakrishnan Kannan, Piyush Sao, Hao Lu 0001, Jakub Kurzak, Gundolf Schenk, Yongmei Shi, Seung-Hwan Lim, Sharat Israni, Vijay Thakkar, Guojing Cong, Robert M. Patton, Sergio Baranzini, Richard W. Vuduc, Thomas E. Potok
SC5