Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Yasin El Abiead

dblp:305/6805 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0003-4392-7706ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 3 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › metabolomics
computational metabolomics
0.612022
Homologue series detection and management in LC-MS data with homologueDiscoverer · Bioinform. 2022
Bioinformatics and computational biology › metabolomics
untargeted metabolomics
0.612022
Homologue series detection and management in LC-MS data with homologueDiscoverer · Bioinform. 2022
Bioinformatics and computational biology
metabolomics
0.512021
mzRAPP: a tool for reliability assessment of data pre-processing in non-targeted metabolomics · Bioinform. 2021

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

local database · 0.6interactive visualization · 0.6performance metrics · 0.5benchmarking · 0.5
YearPublicationVenuePosition
2025 An evaluation methodology for machine learning-based tandem mass spectra similarity prediction
abstract
BACKGROUND: Untargeted tandem mass spectrometry serves as a scalable solution for the organization of small molecules. One of the most prevalent techniques for analyzing the acquired tandem mass spectrometry data (MS/MS) - called molecular networking - organizes and visualizes putatively structurally related compounds. However, a key bottleneck of this approach is the comparison of MS/MS spectra used to identify nearby structural neighbors. Machine learning (ML) approaches have emerged as a promising technique to predict structural similarity from MS/MS that may surpass the current state-of-the-art algorithmic methods. However, the comparison between these different ML methods remains a challenge because there is a lack of standardization to benchmark, evaluate, and compare MS/MS similarity methods, and there are no methods that address data leakage between training and test data in order to analyze model generalizability. RESULT: In this work, we present the creation of a new evaluation methodology using a train/test split that allows for the evaluation of machine learning models at varying degrees of structural similarity between training and test sets. We also introduce a training and evaluation framework that measures prediction accuracy on domain-inspired annotation and retrieval metrics designed to mirror real-world applications. We further show how two alternative training methods that leverage MS specific insights (e.g., similar instrumentation, collision energy, adduct) affect method performance and demonstrate the orthogonality of the proposed metrics. We especially highlight the role that collision energy plays in prediction errors. Finally, we release a continually updated version of our dataset online along with our data cleaning and splitting pipelines for community use. CONCLUSION: It is our hope that this benchmark will serve as the basis of development for future machine learning approaches in MS/MS similarity and facilitate comparison between models. We anticipate that the introduced set of evaluation metrics allows for a better reflection of practical performance.
Michael Strobel 0002, Alberto Gil-de-la-Fuente, Mohammad Reza Shahneh, Yasin El Abiead, Roman Bushuiev, Anton Bushuiev, Tomás Pluskal, Mingxun Wang 0001
BMC Bioinform.4
2022 Homologue series detection and management in LC-MS data with homologueDiscoverer
abstract
SUMMARY: Untargeted metabolomics data analysis is highly labour intensive and can be severely frustrated by both experimental noise and redundant features. Homologous polymer series is a particular case of features that can either represent large numbers of noise features or alternatively represent features of interest with large peak redundancy. Here, we present homologueDiscoverer, an R package that allows for the targeted and untargeted detection of homologue series as well as their evaluation and management using interactive plots and simple local database functionalities. AVAILABILITY AND IMPLEMENTATION: homologueDiscoverer is freely available at GitHub https://github.com/kevinmildau/homologueDiscoverer. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Kevin Mildau, Justin J. J. van der Hooft, Mira Flasch, Benedikt Warth, Yasin El Abiead, Gunda Koellensperger, Jürgen Zanghellini, Christoph Bueschl
Bioinform.5
2021 mzRAPP: a tool for reliability assessment of data pre-processing in non-targeted metabolomics
abstract
SUMMARY: Reliability assessment of automated pre-processing of liquid chromatography-high resolution mass spectrometry data presents a significant challenge. Here, we present a tool named mzRAPP, which generates and validates a benchmark from user-supplied information and later utilizes it for reliability assessment of data pre-processing. As a result, mzRAPP produces several performance metrics for different steps of the pre-processing workflow, supporting five of the most commonly used pre-processing tools. AVAILABILITY AND IMPLEMENTATION: mzRAPP is implemented in R and can be downloaded from GitHub under GNU GPL v.3.0 licence. Extensive documentation, background and examples are available at (https://github.com/YasinEl/mzRAPP). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Yasin El Abiead, Maximilian Milford, Reza M. Salek, Gunda Koellensperger
Bioinform.1