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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pierre Bartet

dblp:369/8509 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 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 · 67% Computational science and engineering · 33%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
gene expression analysis
0.912025
Self-supervised representation learning on gene expression data · Bioinform. 2025
Bioinformatics and computational biology › statistical genetics
phenotype prediction
0.912025
Self-supervised representation learning on gene expression data · Bioinform. 2025
Computational science and engineering
self-supervised representation learning
0.912025
Self-supervised representation learning on gene expression data · Bioinform. 2025

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

self-supervised learning · 0.9deep learning · 0.9
YearPublicationVenuePosition
2025 Self-supervised representation learning on gene expression data
abstract
MOTIVATION: Predicting phenotypes from gene expression data is a crucial task in biomedical research, enabling insights into disease mechanisms, drug responses, and personalized medicine. Traditional machine learning and deep learning rely on supervised learning, which requires large quantities of labeled data that are costly and time-consuming to obtain in the case of gene expression data. Self-supervised learning has recently emerged as a promising approach to overcome these limitations by extracting information directly from the structure of unlabeled data. RESULTS: In this study, we investigate the application of state-of-the-art self-supervised learning methods to bulk gene expression data for phenotype prediction. We selected three self-supervised methods, based on different approaches, to assess their ability to exploit the inherent structure of the data and to generate qualitative representations which can be used for downstream predictive tasks. By using several publicly available gene expression datasets, we demonstrate how the selected methods can effectively capture complex information and improve phenotype prediction accuracy. The results obtained show that self-supervised learning methods can outperform traditional supervised models besides offering significant advantage by reducing the dependency on annotated data. We provide a comprehensive analysis of the performance of each method by highlighting their strengths and limitations. We also provide recommendations for using these methods depending on the case under study. Finally, we outline future research directions to enhance the application of self-supervised learning in the field of gene expression data analysis. This study is the first work that deals with bulk RNA-Seq data and self-supervised learning. AVAILABILITY AND IMPLEMENTATION: The code and results are available at https://github.com/kdradjat/ssrl-rnaseq.
Kevin Dradjat, Massinissa Hamidi, Pierre Bartet, Blaise Hanczar
Bioinform.3
2023 Prediction of Secondary Structure for Long Non-Coding RNAs using a Recursive Cutting Method based on Deep Learning
abstract
Accurately predicting the secondary structure of RNA, particularly for long non-coding RNA, has direct implications in healthcare, where it can be used for diagnostic, therapeutic, and drug discovery purposes. However, the majority of previous approaches are too costly in terms of computation budget to cope with the increasing complexity of long RNAs, and the ones that can scale to long RNAs lack accuracy to reliably predict their structures. We propose a new approach combining recursive cutting and machine learning techniques for predicting the secondary structures of long non-coding RNAs. In comparison, our method proves to be computationally efficient by recursively partitioning a sequence into smaller fragments until they can be easily managed by an existing model. We perform a benchmark of different state-of-the-art models and show that our approach indeed demonstrates better performance for long RNAs and a potential to bring significant improvements in the future, as well as interesting enhancing properties, which we discuss.
Loïc Omnes, Eric Angel, Pierre Bartet, François Radvanyi, Fariza Tahi
BIBE3