Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniel Suveges
dblp:236/0784
· DBLP profile ↗
2ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0003-4133-0447ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 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
2 papers |
Bioinformatics and computational biology · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
biomedical text mining |
0.9 | 1 | 2025 | Lit-OTAR framework for extracting biological evidences from literature · Bioinform. 2025 |
Bioinformatics and computational biology
drug discovery |
0.9 | 1 | 2025 | Lit-OTAR framework for extracting biological evidences from literature · Bioinform. 2025 |
Bioinformatics and computational biology › biomedical text mining
entity normalization |
0.9 | 1 | 2025 | Lit-OTAR framework for extracting biological evidences from literature · Bioinform. 2025 |
Bioinformatics and computational biology › biomedical text mining
named entity recognition |
0.9 | 1 | 2025 | Lit-OTAR framework for extracting biological evidences from literature · Bioinform. 2025 |
Bioinformatics and computational biology › genomics › genome sequencing
low-coverage whole-genome sequencing |
0.4 | 1 | 2019 | Very low-depth whole-genome sequencing in complex trait association studies · Bioinform. 2019 |
Bioinformatics and computational biology › genomics › genotyping
genotype imputation |
0.1 | 1 | 2019 | Very low-depth whole-genome sequencing in complex trait association studies · Bioinform. 2019 |
Methods — techniques the papers use, named apart from their topics
named entity recognition · 0.9entity normalization · 0.9deep learning · 0.9genotype imputation · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Lit-OTAR framework for extracting biological evidences from literatureabstractSUMMARY: The lit-OTAR framework, developed through a collaboration between Europe PMC and Open Targets, leverages deep learning to revolutionize drug discovery by extracting evidence from scientific literature for drug target identification and validation. This novel framework combines named entity recognition for identifying gene/protein (target), disease, organism, and chemical/drug within scientific texts, and entity normalization to map these entities to databases like Ensembl, Experimental Factor Ontology, and ChEMBL. Continuously operational, it has processed over 39 million abstracts and 4.5 million full-text articles and preprints to date, identifying more than 48.5 million unique associations that significantly help accelerate the drug discovery process and scientific research >29.9 m distinct target-disease, 11.8 m distinct target-drug, and 8.3 m distinct disease-drug relationships. AVAILABILITY AND IMPLEMENTATION: The results are accessible through Europe PMC's SciLite web app (https://europepmc.org/) and its annotations API (https://europepmc.org/annotationsapi), as well as via the Open Targets Platform (https://platform.opentargets.org/). The daily pipeline is available at https://github.com/ML4LitS/otar-maintenance, and the Open Targets ETL processes are available at https://github.com/opentargets. Santosh Tirunagari, Shyamasree Saha, Aravind Venkatesan, Daniel Suveges, Miguel Carmona, Annalisa Buniello, David Ochoa, Johanna R. McEntyre, Ellen M. McDonagh, Melissa Harrison |
Bioinform. | 4 |
| 2019 | Very low-depth whole-genome sequencing in complex trait association studiesabstractMOTIVATION: Very low-depth sequencing has been proposed as a cost-effective approach to capture low-frequency and rare variation in complex trait association studies. However, a full characterization of the genotype quality and association power for very low-depth sequencing designs is still lacking. RESULTS: We perform cohort-wide whole-genome sequencing (WGS) at low depth in 1239 individuals (990 at 1× depth and 249 at 4× depth) from an isolated population, and establish a robust pipeline for calling and imputing very low-depth WGS genotypes from standard bioinformatics tools. Using genotyping chip, whole-exome sequencing (75× depth) and high-depth (22×) WGS data in the same samples, we examine in detail the sensitivity of this approach, and show that imputed 1× WGS recapitulates 95.2% of variants found by imputed GWAS with an average minor allele concordance of 97% for common and low-frequency variants. In our study, 1× further allowed the discovery of 140 844 true low-frequency variants with 73% genotype concordance when compared to high-depth WGS data. Finally, using association results for 57 quantitative traits, we show that very low-depth WGS is an efficient alternative to imputed GWAS chip designs, allowing the discovery of up to twice as many true association signals than the classical imputed GWAS design. AVAILABILITY AND IMPLEMENTATION: The HELIC genotype and WGS datasets have been deposited to the European Genome-phenome Archive (https://www.ebi.ac.uk/ega/home): EGAD00010000518; EGAD00010000522; EGAD00010000610; EGAD00001001636, EGAD00001001637. The peakplotter software is available at https://github.com/wtsi-team144/peakplotter, the transformPhenotype app can be downloaded at https://github.com/wtsi-team144/transformPhenotype. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Arthur Gilly, Lorraine Southam, Daniel Suveges, Karoline Kuchenbaecker, Rachel Moore, Giorgio E. M. Melloni, Konstantinos Hatzikotoulas, Aliki-Eleni Farmaki, Graham Ritchie, Jeremy Schwartzentruber, Petr Danecek, Britt Kilian, Martin O. Pollard, Xiangyu Ge, Emmanouil Tsafantakis, George V. Dedoussis, Eleftheria Zeggini |
Bioinform. | 3 |