Rethinking Performance Measures of RNA Secondary Structure Problems
- URL: http://arxiv.org/abs/2401.05351v1
- Date: Mon, 4 Dec 2023 08:46:24 GMT
- Title: Rethinking Performance Measures of RNA Secondary Structure Problems
- Authors: Frederic Runge, J\"org K. H. Franke, Daniel Fertmann, Frank Hutter
- Abstract summary: Deep learning methods have surpassed traditional algorithms by predicting complex features like pseudoknots and multi-interacting base pairs.
We propose the Weisfeiler-Lehman graph kernel (WL) as an alternative metric.
- Score: 42.25267871026153
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Accurate RNA secondary structure prediction is vital for understanding
cellular regulation and disease mechanisms. Deep learning (DL) methods have
surpassed traditional algorithms by predicting complex features like
pseudoknots and multi-interacting base pairs. However, traditional distance
measures can hardly deal with such tertiary interactions and the currently used
evaluation measures (F1 score, MCC) have limitations. We propose the
Weisfeiler-Lehman graph kernel (WL) as an alternative metric. Embracing
graph-based metrics like WL enables fair and accurate evaluation of RNA
structure prediction algorithms. Further, WL provides informative guidance, as
demonstrated in an RNA design experiment.
Related papers
- Comprehensive benchmarking of large language models for RNA secondary structure prediction [0.0]
RNA-LLM uses large datasets of RNA sequences to learn, in a self-supervised way, how to represent each RNA base with a semantically rich numerical vector.
Among them, predicting the secondary structure is a fundamental task for uncovering RNA functional mechanisms.
We present a comprehensive experimental analysis of several pre-trained RNA-LLM, comparing them for the RNA secondary structure prediction task in a unified deep learning framework.
arXiv Detail & Related papers (2024-10-21T17:12:06Z) - Predicting Distance matrix with large language models [1.8855270809505869]
RNA structure prediction remains a significant challenge due to data limitations.
Traditional methods such as nuclear magnetic resonance spectroscopy, Xray crystallography, and electron microscopy are expensive and time consuming.
Distance maps provide a simplified representation of spatial constraints between nucleotides, capturing essential relationships without requiring a full 3D model.
arXiv Detail & Related papers (2024-09-24T10:28:55Z) - BEACON: Benchmark for Comprehensive RNA Tasks and Language Models [60.02663015002029]
We introduce the first comprehensive RNA benchmark BEACON (textbfBEnchmtextbfArk for textbfCOmprehensive RtextbfNA Task and Language Models).
First, BEACON comprises 13 distinct tasks derived from extensive previous work covering structural analysis, functional studies, and engineering applications.
Second, we examine a range of models, including traditional approaches like CNNs, as well as advanced RNA foundation models based on language models, offering valuable insights into the task-specific performances of these models.
Third, we investigate the vital RNA language model components
arXiv Detail & Related papers (2024-06-14T19:39:19Z) - Splicing Up Your Predictions with RNA Contrastive Learning [4.35360799431127]
We extend contrastive learning techniques to genomic data by utilizing similarities between functional sequences generated through alternative splicing gene duplication.
We validate their utility on downstream tasks such as RNA half-life and mean ribosome load prediction.
Our exploration of the learned latent space reveals that our contrastive objective yields semantically meaningful representations.
arXiv Detail & Related papers (2023-10-12T21:51:25Z) - Deciphering RNA Secondary Structure Prediction: A Probabilistic K-Rook Matching Perspective [63.3632827588974]
We introduce RFold, a method that learns to predict the most matching K-Rook solution from the given sequence.
RFold achieves competitive performance and about eight times faster inference efficiency than state-of-the-art approaches.
arXiv Detail & Related papers (2022-12-02T16:34:56Z) - E2Efold-3D: End-to-End Deep Learning Method for accurate de novo RNA 3D
Structure Prediction [46.38735421190187]
We develop the first end-to-end deep learning approach, E2Efold-3D, to accurately perform the textitde novo RNA structure prediction.
Several novel components are proposed to overcome the data scarcity, such as a fully-differentiable end-to-end pipeline, secondary structure-assisted self-distillation, and parameter-efficient backbone formulation.
arXiv Detail & Related papers (2022-07-04T17:15:35Z) - Computational prediction of RNA tertiary structures using machine
learning methods [14.35527588241679]
Computational prediction approaches can help to understand RNA structures and their stabilizing factors.
Although their usage in protein-related fields has a long history, the use of machine learning methods in predicting RNA tertiary structures is new and rare.
arXiv Detail & Related papers (2020-09-03T04:01:43Z) - Review of Machine-Learning Methods for RNA Secondary Structure
Prediction [21.3539253580504]
We provide a comprehensive overview of RNA secondary structure prediction methods based on machine-learning technologies.
The current pending issues in the field of RNA secondary structure prediction and future trends are also discussed.
arXiv Detail & Related papers (2020-09-01T03:17:15Z) - A Systematic Approach to Featurization for Cancer Drug Sensitivity
Predictions with Deep Learning [49.86828302591469]
We train >35,000 neural network models, sweeping over common featurization techniques.
We found the RNA-seq to be highly redundant and informative even with subsets larger than 128 features.
arXiv Detail & Related papers (2020-04-30T20:42:17Z) - RNA Secondary Structure Prediction By Learning Unrolled Algorithms [70.09461537906319]
In this paper, we propose an end-to-end deep learning model, called E2Efold, for RNA secondary structure prediction.
The key idea of E2Efold is to directly predict the RNA base-pairing matrix, and use an unrolled algorithm for constrained programming as the template for deep architectures to enforce constraints.
With comprehensive experiments on benchmark datasets, we demonstrate the superior performance of E2Efold.
arXiv Detail & Related papers (2020-02-13T23:21:25Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.