Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

123246369492 · May 202619922001200920172026
48 results for RNA secondary structures

Machine learning improves RNA secondary structure prediction.

problem Stagnant performance of RNA secondary structure prediction methods.
method Machine learning, especially deep learning, is used to predict RNA secondary structures.
result Machine learning methods have improved the prediction of RNA secondary structures.

E2Efold predicts RNA secondary structures better than previous methods.

problem RNA secondary structure prediction with constraints.
method End-to-end deep learning model using unrolled algorithms to enforce constraints.
result E2Efold predicts significantly better structures, especially for pseudoknotted structures.

Symmetric CNNs improve sequential recommendation and protein structure prediction.

problem Improving prediction accuracy in sequential recommendation and protein structure inference.
method Developed a CNN architecture that preserves symmetry in convolutional layers, using parameterized convolutional kernels.
result Symmetric structured CNNs achieve better performance with fewer parameters.

We study the secondary structure of RNA determined by Watson-Crick pairing without pseudo-knots using Milnor invariants of links. We focus on the first non-trivial invariant, which we call the Heisenberg invariant. The Heisenberg invariant, which is an integer, can be interpreted in terms of the Heisenberg group as wel…

2008-09-18abs ↗pdf ↗

RNA structures show that a significant portion of bases do not form hydrogen bonds.

problem Understanding the unpaired bases in RNA secondary structures.
method Comparing random words in free groups to RNA sequences, analyzing word lengths.
result The expected fraction of unpaired bases converges to a constant λ2λ_2.

A deep learning model organizes RNA graphs to reveal folding patterns and properties.

problem Organizing and understanding the complex folding patterns of RNA secondary structures.
method Geometric scattering autoencoder (GSAE) network for learning graph embeddings.
result GSAE accurately reflects bistable RNA structures and can sample new folding trajectories.

Designing RNA molecules has garnered recent interest in medicine, synthetic biology, biotechnology and bioinformatics since many functional RNA molecules were shown to be involved in regulatory processes for transcription, epigenetics and translation. Since an RNA's function depends on its structural properties, the RN…

2018-12-31abs ↗pdf ↗

New benchmarks for RNA 3D structure-function modeling.

problem Lack of standardized benchmarks for RNA deep learning.
method Developed seven benchmark datasets, provided tools for data handling, and offered a user-friendly environment for model comparison.
result Demonstrated utility with baseline results using a relational graph neural network.

Many machine learning techniques have been proposed in the last few years to process data represented in graph-structured form. Graphs can be used to model several scenarios, from molecules and materials to RNA secondary structures. Several kernel functions have been defined on graphs that coupled with kernelized learn…

2018-11-16abs ↗pdf ↗

Study uses knot theory to model RNA foldings, emphasizing both entanglement and intrachain interactions.

problem Modeling RNA foldings considering both entanglement and intrachain interactions.
method Combines knot theory with embedded rigid vertex graphs to emphasize both entanglement and intrachain interactions of RNA foldings.
result Defines and computes a coloring counting invariant for stuck links, providing explicit computations for arc diagrams of RNA foldings.

HSSE framework embeds single-cell RNA-seq data at multiple scales.

problem Capturing heterogeneous local structure in single-cell RNA-seq data.
method Hierarchical sheaf spectral embedding (HSSE) framework.
result HSSE achieves competitive or improved performance in single-cell RNA-seq data representation learning.

In this study, we generalize double tangent bundles to double jet bundles. We present a secondary vector bundle structure on a 1-jet of a vector bundle. We show that 1-jet of a vector bundle carries two vector bundle structures, namely primary and secondary structures. We also show that the manifold charts induced by p…

2016-01-17abs ↗pdf ↗

Recent advances in high-throughput cDNA sequencing (RNA-Seq) technology have revolutionized transcriptome studies. A major motivation for RNA-Seq is to map the structure of expressed transcripts at nucleotide resolution. With accurate computational tools for transcript reconstruction, this technology may also become us…

2013-09-20abs ↗pdf ↗

Improved GPLVM model for single-cell RNA-seq data.

problem Lack of effective scalable models for clustering cell types in large-scale single-cell RNA-seq data.
method Introduces amortized stochastic variational Bayesian GPLVM (BGPLVM) tailored for single-cell RNA-seq.
result Matches the performance of scVI on synthetic and real-world datasets and reveals more interpretable latent structures.

PS8-Net improves eight-state protein secondary structure prediction accuracy.

problem Precise prediction of eight-state protein secondary structure (PSS) is crucial in bioinformatics.
method PS8-Net is a new deep convolutional neural network (DCNN) that uses a PS8 module with skip connections to enhance accuracy.
result PS8-Net achieves 76.89% Q8 accuracy on benchmark datasets.

Non-coding RNA (ncRNA) are RNA sequences which don't code for a gene but instead carry important biological functions. The task of ncRNA classification consists in classifying a given ncRNA sequence into its family. While it has been shown that the graph structure of an ncRNA sequence folding is of great importance for…

2019-05-16abs ↗pdf ↗

Generalized quandle polynomial used for stuquandles, stuck links, and RNA folding.

problem Defining polynomial invariants for stuquandles, stuck links, and RNA foldings.
method Introduced a generalized quandle polynomial and proved its invariance for stuquandles. Used this invariant to define polynomials for stuck links and RNA foldings.
result Polynomial invariants for stuquandles, stuck links, and RNA foldings.

Tree data are ubiquitous because they model a large variety of situations, e.g., the architecture of plants, the secondary structure of RNA, or the hierarchy of XML files. Nevertheless, the analysis of these non-Euclidean data is difficult per se. In this paper, we focus on the subtree kernel that is a convolution kern…

2019-04-10abs ↗pdf ↗

The Regularized Nonlinear Acceleration (RNA) algorithm is an acceleration method capable of improving the rate of convergence of many optimization schemes such as gradient descend, SAGA or SVRG. Until now, its analysis is limited to convex problems, but empirical observations shows that RNA may be extended to wider set…

2018-06-01abs ↗pdf ↗

New method detects RNA modifications without prior training, revealing novel sites.

problem Detecting RNA modifications with high accuracy and sensitivity.
method Anomaly detection using nanopore raw ionic current signals and nearest neighbor comparison.
result Detects diverse RNA modifications without prior training, including a novel 2'-O-methylated site in DENV.

In this work we propose a method to compute continuous embeddings for kmers from raw RNA-seq data, without the need for alignment to a reference genome. The approach uses an RNN to transform kmers of the RNA-seq reads into a 2 dimensional representation that is used to predict abundance of each kmer. We report that our…

2018-10-08abs ↗pdf ↗

Secondary Calculus formalizes PDEs using cohomology, simplifying their study.

problem Formalizing and simplifying the study of partial differential equations (PDEs).
method Using cohomology of diffieties to formalize PDEs and their properties.
result Differential calculus on PDE solution spaces is homotopy calculus on horizontal De Rham algebras of diffieties.

Mathematician summarizes protein geometry and mutation effects.

problem Understanding how proteins mutate and their structure-function relationship.
method Mathematical analysis of protein structures and functions, focusing on hydrogen bonds and secondary structure.
result Protein secondary structure regulates mutation by stabilizing or destabilizing regions.

We give a survey of the approaches to classifying foliations, starting with the Haefliger classifying spaces and the various results and examples about the secondary classes of foliations. Various dynamical properties of foliations are introduced and discussed, including expansion rate, local entropy, and orbit growth …

2008-04-08abs ↗pdf ↗

Deep learning helps remove secondary BB-mode polarization to detect primordial gravitational waves.

problem Removing secondary BB-mode polarization from CMB data to detect primordial gravitational waves.
method Applied deep learning (ResUNet-CMB) to estimate and remove multiple sources of secondary BB-mode polarization.
result Deep learning can produce nearly optimal, unbiased estimates of the amplitude of primordial gravitational waves.

DiffKnock improves feature selection in neural networks with complex dependencies and non-linear associations.

problem Selecting important features in neural networks with complex dependencies and non-linear associations.
method DiffKnock uses diffusion models to generate knockoffs and neural network statistics to measure feature importance.
result DiffKnock outperforms existing methods in detecting non-linear associations and preserving feature dependencies.

In this paper we define K-theoretic secondary invariants attached to a Lie groupoid GG. The K-theory of Cr(Gad0)C^*_r(G_{ad}^0) (where Gad0G_{ad}^0 is the adiabatic deformation GG restricted to the interval [0,1)[0,1)) is the receptacle for K-theoretic secondary invariants. We give a Lie groupoid version of construction given b…

2016-09-26abs ↗pdf ↗

Let G be a simple Lie group of real rank one, and S the ideal boundary of the corresponding symmetric space of noncompact type (H^n_R, H^n_C, H^n_H or H^2_O). We show the finiteness of the possible values of the secondary characteristic classes of transversely homogeneous foliations on a fixed manifold whose transverse…

2012-05-15abs ↗pdf ↗

Constructs combinatorial 2D topological field theories from cyclic A-infinity algebras.

problem Developing a combinatorial framework for 2D topological field theories.
method Using triangulations and polygonal decompositions, constructing cochains on a CW complex.
result Existence of combinatorial 2D topological field theories based on cyclic A-infinity algebras.

Graph Canonical Correlation Analysis improves CCA for multiomics datasets.

problem Limited ability of conventional CCA methods to incorporate structured patterns in cross-correlation matrices.
method Graph Canonical Correlation Analysis (gCCA) calculates canonical correlations based on the graph structure of cross-correlation matrices.
result gCCA outperforms competing CCA methods in simulations and multiomics dataset analysis.

Study of spectral flow in symmetric Toeplitz operator families.

problem Understanding spectral flow in families of symmetric Toeplitz operators.
method Analog of Atiyah-Singer-Robbin-Salamon theorem for Z2\mathbb{Z}_2-valued spectral flow.
result Graded secondary spectral flow equals secondary index of a Callias-type operator.

The knot invariant Upsilon, defined by Ozsvath, Stipsicz, and Szabo, induces a homomorphism from the smooth knot concordance group to the group of piecewise linear functions on the interval [0,2]. Here we define a set of related secondary invariants, each of which assigns to a knot a piecewise linear function on [0,2].…

2016-10-17abs ↗pdf ↗

The paper tackles online learning with two types of losses and shows it's impossible without certain assumptions.

problem Online learning with primary and secondary losses where the secondary loss is bounded by a linear threshold.
method Analyzes the feasibility of achieving low regret with respect to the primary loss while keeping the secondary loss within a linear threshold.
result Achieving the goal is impossible without bounded variance assumption on the secondary loss.

Fuses ITRs for primary and secondary outcomes to minimize harm.

problem Learn an ITR maximizing primary outcome while minimizing harm to secondary outcomes.
method Introduces fusion penalty to encourage similar recommendations for different outcomes. Two algorithms estimate the ITR using surrogate loss functions.
result Agreement rate between primary and secondary optimal ITRs converges faster than ignoring secondary outcomes.