Eelke Bart Lenselink

Eelke Bart Lenselink

Auto-generated profile, based on publicly available information

Eelke Bart Lenselink

Galapagos (Belgium)

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 May 2023 in Journal of Chemical Information and Modeling
Verified
Journal Article
Closed access
WCWei Chen
Wei Chen
DCDi Cui
Di Cui
SJSteven V. Jerome
Steven V. Jerome
MMMayako Michino
Mayako Michino
ELEelke B. Lenselink
Eelke B. Lenselink
LWLingle Wang
Lingle Wang

15 June 2020 in Journal of Chemical Information and Modeling
Verified
Journal Article
Closed access
FDFrancesca Deflorian
Francesca Deflorian
LPLaura Perez-Benito
Laura Perez-Benito
ELEelke B Lenselink
Eelke B Lenselink
MCMiles Congreve
Miles Congreve
HVHerman W. T. van Vlijmen
Herman W. T. van Vlijmen
GTGary Tresadern
Gary Tresadern

17 July 2021 in Journal of Computer-Aided Molecular Design
Verified
Journal Article
Open access
PDF file
ELEelke B. Lenselink
Eelke B. Lenselink
PSPieter F. W. Stouten
Pieter F. W. Stouten
Accurate prediction of lipophilicity—logP—based on molecular structures is a well-established field. Predictions of logP are often used to drive forward drug discovery projects. Driven by the SAMPL7 challenge, in this manuscript we describe the steps that were taken to construct a novel machine learning model that can predict and generalize well. This model is based on the recently described Directed-Message Passing Neural Networks (D-MPNNs). Further enhancements included: both the inclusion of additional datasets from ChEMBL (RMSE improvement of 0.03), and the addition of helper tasks (RMSE improvement of 0.04). To the best of our knowledge, the concept of adding predictions from other models (Simulations Plus logP and logD@pH7.4, respectively) as helper tasks is novel and could be applied in a broader context. The final model that we constructed and used to participate in the challenge ranked 2/17 ranked submissions with an RMSE of 0.66, and an MAE of 0.48 (submission: Chemprop). On other datasets the model also works well, especially retrospectively applied to the SAMPL6 challenge where it would have ranked number one out of all submissions (RMSE of 0.35). Despite the fact that our model works well, we conclude with suggestions that are expected to improve the model even further.

9 June 2023 in Journal of Chemical Information and Modeling
Verified
Journal Article
Open access
SLSohvi Luukkonen
Sohvi Luukkonen
EMErik Meijer
Erik Meijer
GTGiovanni A. Tricarico
Giovanni A. Tricarico
JHJohan Hofmans
Johan Hofmans
PSPieter F. W. Stouten
Pieter F. W. Stouten
ELEelke B. Lenselink
Eelke B. Lenselink
Protein kinases are a protein family that plays an important role in several complex diseases such as cancer and cardiovascular and immunological diseases. Protein kinases have conserved ATP binding sites, which when targeted can lead to similar activities of inhibitors against different kinases. This can be exploited to create multitarget drugs. On the other hand, selectivity (lack of similar activities) is desirable in order to avoid toxicity issues. There is a vast amount of protein kinase activity data in the public domain, which can be used in many different ways. Multitask machine learning models are expected to excel for these kinds of data sets because they can learn from implicit correlations between tasks (in this case activities against a variety of kinases). However, multitask modeling of sparse data poses two major challenges: (i) creating a balanced train-test split without data leakage and (ii) handling missing data. In this work, we construct a protein kinase benchmark set composed of two balanced splits without data leakage, using random and dissimilarity-driven cluster-based mechanisms, respectively. This data set can be used for benchmarking and developing protein kinase activity prediction models. Overall, the performance on the dissimilarity-driven cluster-based split is lower than on random split-based sets for all models, indicating poor generalizability of models. Nevertheless, we show that multitask deep learning models, on this very sparse data set, outperform single-task deep learning and tree-based models. Finally, we demonstrate that data imputation does not improve the performance of (multitask) models on this benchmark set.

1 January 2015
Verified
Book Chapter
Closed access
TBThijs Beuming
Thijs Beuming
BLBart Lenselink
Bart Lenselink
DPDaniele Pala
Daniele Pala
FMFiona McRobb
Fiona McRobb
MRMatt Repasky
Matt Repasky
WSWoody Sherman
Woody Sherman

28 September 2018 in Information Sciences
Verified
Journal Article
Closed access
IYIryna Yevseyeva
Iryna Yevseyeva
ELEelke B. Lenselink
Eelke B. Lenselink
AVAlice de Vries
Alice de Vries
AIAdriaan P. Ijzerman
Adriaan P. Ijzerman
ADAndré H. Deutz
André H. Deutz
MEMichael T.M. Emmerich
Michael T.M. Emmerich