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,657 papers · 148 categories

Trend · papers per month

12253749 · May 202619922001200920172026
48 results for knotted proteins

Mathematical pipeline identifies structural homology of knotted proteins.

problem Quantification and classification of protein structures, especially knotted proteins, require noise-free and complete data.
method Developed a geometric framework using persistent homology to analyze protein structures.
result Persistent homology accurately represents structural homology of knotted proteins and identifies geometric features of protein entanglement.

Long, flexible physical filaments are naturally tangled and knotted, from macroscopic string down to long-chain molecules. The existence of knotting in a filament naturally affects its configuration and properties, and may be very stable or disappear rapidly under manipulation and interaction. Knotting has been previou…

2016-11-18abs ↗pdf ↗

Proteins are linear molecular chains that often fold to function. The topology of folding is widely believed to define its properties and function, and knot theory has been applied to study protein structure and its implications. More that 97% of proteins are, however, classified as unknots when intra-chain interaction…

2019-12-19abs ↗pdf ↗

Method optimizes knotting pathways in constrained polymers.

problem Understanding how geometric constraints affect knot formation in polymers.
method Topological steering using knotoid spectrum and mean unravelling number.
result Geometric constraints increase the frequency of twist knots in polymers.

Classifies uncolored bonded knots with up to 7 singularity points.

problem Classifying uncolored bonded knots with up to 7 singularity points.
method Generation of planar graphs, conversion into bonded knot diagrams, use of Yamada polynomial, and brute-force Reidemeister moves.
result Systematic classification of uncolored bonded knots with singularity number at most seven.

The protein recombinase can change the knot type of circular DNA. The action of a recombinase converting one knot into another knot is normally mathematically modeled by band surgery. Band surgeries on a 2-bridge knot N((4mn-1)/(2m)) yielding a (2,2k)-torus link are characterized. We apply this and other rational tangl…

2011-08-03abs ↗pdf ↗

Recent studies classify the topology of proteins by analysing the distribution of their projections using knotoids. The approximation of this distribution depends on the number of projection directions that are sampled. Here we investigate the relation between knotoids differing only by small perturbations of the direc…

2019-09-18abs ↗pdf ↗

Focusing on a small set of proteins that i) fold in a concerted, all-or-none fashion and ii) do not contain knots or slipknots, we show that the Gauss linking integral, the torsion and the number of sequence-distant contacts provide information regarding the folding rate. Our results suggest that the global topology/ge…

2018-12-03abs ↗pdf ↗

Polynomial invariants classify molecular chains based on their contact arrangements.

problem No established invariants for molecular chains with both hard and soft contacts.
method Developed polynomial invariants for circuit topology of molecular chains.
result Polynomial invariants efficiently classify chains with various contact types.
Graphoidsmath.CO

Graphoids are topological invariants of virtual graph diagrams.

problem Understanding knotted graphs with open ends in proteins and simplifying virtual spatial graphs.
method Topological interpretations of graphoids using graph Reidemeister moves.
result Virtual graphoids are useful for studying knotted graphs and simplifying spatial graphs.

Uniform Closure Method and Bayes classifier perform similarly in classifying open knots.

problem Classifying knots in open macromolecular chains.
method Used the Bayes MAP classifier and compared it to the Uniform Closure Method.
result Both methods have comparable accuracy and positive predictive value.

The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we provide a framework for working with subknots inside of knot diagrams via knotoid dia…

2018-03-19abs ↗pdf ↗

We equip a knot KK with a set of colored bonds, that is, colored intervals properly embedded into R3K\mathbb{R}^3 \setminus K. Such a construction can be viewed as a structure that topologically models a closed protein chain including any type of bridges connecting the backbone residues. We introduce an invariant of su…

2019-10-10abs ↗pdf ↗

This paper is a survey on the theory of knotoids and braidoids. Knotoids are open ended knot diagrams in surfaces and braidoids are geometric objects analogous to classical braids, forming a counterpart theory to the theory of knotoids in the plane. We survey through the fundamental notions and existing works on these …

2018-11-28abs ↗pdf ↗

Knots have been considered to be useful models for simulating molecular chains such as DNA and proteins. One quantity that we are interested on molecular knots is the minimum number of monomers necessary to realize a knot. In this paper we consider every knot in the cubic lattice. Especially the minimal length of a kno…

2014-11-07abs ↗pdf ↗

Knots are commonly found in molecular chains such as DNA and proteins, and they have been considered to be useful models for structural analysis of these molecules. One interested quantity is the minimum number of monomers necessary to realize a molecular knot. The minimum lattice length $\mbox{Len}(K)$ of a knot KK i…

2014-11-07abs ↗pdf ↗

PANDA predicts protein binding affinity changes from sequences, outperforming existing methods.

problem Accurately predicting changes in protein binding affinity due to mutations.
method Sequence-based machine learning approach using protein sequence information.
result PANDA achieves higher Pearson correlation coefficients than existing methods.

A new model explains protein interactions via electron delocalization.

problem Understanding how protein interactions affect each other.
method Quantized discrete differential geometry of n-simplices.
result Allosteric regulation follows from the model of interactions.

EBM predicts protein conformations at atomic scale using crystallized data.

problem Predicting the conformation of a side chain from its context within a protein structure.
method Energy-based model trained on crystallized protein data, evaluating performance on rotamer recovery task.
result EBM achieves performance close to state-of-the-art methods, including Rosetta energy function.

Experimental determination of protein function is resource-consuming. As an alternative, computational prediction of protein function has received attention. In this context, protein structural classification (PSC) can help, by allowing for determining structural classes of currently unclassified proteins based on thei…

2018-04-12abs ↗pdf ↗

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.

EGR refines and assesses protein complex structures.

problem Improving the accuracy of protein complex 3D structures for drug discovery.
method E(3)-equivariant graph neural network (GNN) for multi-task refinement and assessment.
result EGR achieves state-of-the-art performance in refining and assessing protein complexes.

We introduce a new model of proteins, which extends and enhances the traditional graphical representation by associating a combinatorial object called a fatgraph to any protein based upon its intrinsic geometry. Fatgraphs can easily be stored and manipulated as triples of permutations, and these methods are therefore a…

2009-02-06abs ↗pdf ↗

A new diffusion model generates novel protein backbones without relying on pretrained networks.

problem Generating novel protein backbones without relying on pretrained networks.
method Developed a SE(3) invariant diffusion model on multiple frames, called FrameDiff.
result Generated designable protein monomers up to 500 amino acids without pretrained networks.