Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · q-bio/0611066

Kinetics of viral self-assembly: the role of ss RNA antenna

Tao Hu·B. I. Shklovskii
View original source ↗Read source document ↗Export metadata ↓

Abstract

A big class of viruses self-assemble from a large number of identical capsid proteins with long flexible N-terminal tails and ss RNA. We study the role of the strong Coulomb interaction of positive N-terminal tails with ss RNA in the kinetics of the in vitro virus self-assembly. Capsid proteins stick to unassembled chain of ss RNA (which we call "antenna") and slide on it towards the assembly site. We show that at excess of capsid proteins such one-dimensional diffusion accelerates self-assembly more than ten times. On the other hand at excess of ss RNA, antenna slows self-assembly down. Several experiments are proposed to verify the role of ss RNA antenna.

Explore related subjects

q-bio.BMcond-mat.soft

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tao Hu, B. I. Shklovskii. 2007-02-02. Kinetics of viral self-assembly: the role of ss RNA antenna. https://doi.org/10.1103/physreve.75.051901

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Protein B-factor modeling with local magnitude

Topological magnitude characterizes the effective size and spatial organization of metric spaces, offering a geometric approach with potential applications in molecular biology and materials science. Previous work has demonstrated its utility in modeling protein flexibility from structure, but global magnitude weighting requires dense linear systems whose computational cost increases with protein size. We introduce a local magnitude representation that retains residue-level structural information through nearest-neighbor environments. The construction is well posed and geometrically invariant, with central weighting distinguished from scalar neighborhood magnitude. Across 364 proteins, the mean within-protein fitting Pearson correlation coefficient (PCC) increases from 0.725 for global magnitude to 0.728 for local magnitude. Blind-prediction experiments on 345 proteins combine each representation with identical auxiliary descriptors and evaluate random forests and gradient boosting under three validation protocols. Local features improve the primary PCC in all six model--protocol comparisons, with a maximum absolute increase of 0.008 in protein-level ten-fold gradient boosting. For a fixed feature bank, local factorization costs $O(Nk^3)$ compared with $O(N^3)$ for global factorization, where $N$ is the number of C$_α$ atoms and $k$ the neighborhood size. Timing measurements show a computational advantage of local magnitude on large structures. Within the tested single-seed configuration and distinct global and local scale banks, these results support local magnitude as a compact representation that preserves useful B-factor information while reducing feature-extraction costs for large proteins.

q-bio.BM↗
arXiv2026

Kinetic models of a K channel with 2 stage voltage sensor activation and an opening step

The activation of a K channel with 2 voltage sensors and a separate opening step may be described by a 4 state kinetic equation. If $k_{o}$ and $k_{c}$ are the opening and closing rates, and $α$ and $β$ are the voltage sensor rates such that $k_{o}$ $\ggα,k_{c}\ggβ$ and $k_{o}$ $\gg k_{c}$, the kinetic equation may be reduced to a 3 state model where the effective backward rate from the activated-open state is $2βk_{c}/(k_{o}+k_{c})$. However, if a K channel voltage sensor activates in 2 stages, and there is a separate opening step, the occupation probabilities of the states of the channel satisfy a 10 state kinetic equation. When the time constants of the characteristic equation for each voltage sensor differ by an order of magnitude, and $k_{o}$ $\gg k_{c}$, the open state probability is proportional to $n^{2}$, where $n$ satisfies a rate equation, and the derived rates have a similar voltage dependence to the rates $α_{n}$ and $β_{n}$ from voltage clamp data.

q-bio.BM↗
arXiv2026

Predicting protein structures at any folding stage from sequence

Protein structure prediction has largely focused on native conformations, leaving the continuum of unfolded states, folding intermediates, and native structures difficult to access. We present FoldScape, a sequence-conditioned deep learning framework for generating protein conformational ensembles at specified folding fractions $Q$. Trained on approximately one million conformations from 10,000 protein sequences, FoldScape combines coarse-grained folding and all-atom mechanical-unfolding trajectories. It reconstructs three-dimensional $C_α$ chains through hierarchical sliding-window regressions of inter-residue distances, chain-level assembly, and a rectified-flow decoder. By conditioning on folding progress, FoldScape generates conformations from unfolded states through intermediates to native-state structures without protein-specific molecular dynamics at inference. In matched-sample comparisons, FoldScape achieves median conformational-space coverage of 0.989, 0.722, and 0.877 along radius of gyration, fraction of native contacts $Q$, and secondary-structure fraction, respectively, versus 0.05, 0.05, and 0.10 for seed-varied AlphaFold 3 ensembles. Coverage advantages are consistent across the evaluated proteins and robust to binning choices. Reconstruction accuracy remains approximately stable across the evaluated stages of a folding trajectory, and stride-one crop-and-superpose inference extends predictions to chains several times longer than the single-pass limit. Analyses of mechanical-unfolding trajectories show residue-resolved pathways, reproducible extension-conditioned observables across pulling velocities, and geometrically coherent segments in partially unfolded chains. FoldScape extends sequence-based structure prediction beyond a single folded endpoint to controllable conformational-ensemble generation across protein folding.

q-bio.BM↗