OPUS-Rota2: An Improved Fast and Accurate Side-Chain Modeling Method

Gang Xu1,2, Tianqi Ma, Junqing Du3

  • 1Multiscale Research Institute of Complex Systems , Fudan University , Shanghai 200433 , China.

Related Concept Videos

Electron Transport Chains01:28

Electron Transport Chains

The final stage of cellular respiration is oxidative phosphorylation that consists of two steps: the electron transport chain and chemiosmosis. The electron transport chain is a set of proteins found in the inner mitochondrial membrane in eukaryotic cells. Its primary function is to establish a proton gradient that can be used during chemiosmosis to produce ATP and generate electron carriers, such as NAD+ and FAD, that are used in glycolysis and the citric acid cycle.
The ETC is comprised of...
111.7K
Improving Translational Accuracy02:07

Improving Translational Accuracy

Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
14.1K
Radical Chain-Growth Polymerization: Chain Branching01:17

Radical Chain-Growth Polymerization: Chain Branching

The skeletal structure of polymers synthesized via radical polymerization is always branched. For example, the polymerization of ethylene by radical polymerization results in a low-density grade of polyethylene with a heavily branched skeletal structure. Here, the radical site abstracts hydrogen from the growing chain, and the radical site shifts from the end (a primary carbon center) to anywhere within the growing chain (a secondary carbon center). Consequently, the part of the chain from the...
2.4K
Fast Fourier Transform01:10

Fast Fourier Transform

The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
912
The Chain Rule01:30

The Chain Rule

A system of interconnected gears provides a concrete physical interpretation of the Chain Rule in calculus. Consider three gears arranged in sequence, where the rotational speeds of the first, second, and third gears are represented by the variables x, z, and y, respectively. The first gear drives the second, and the second drives the third, so the motion of each gear depends on the one preceding it. This structure naturally leads to a two-stage variable relationship that can be analyzed using...
35
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

The genomes of eukaryotes are punctuated by long stretches of sequence which do not code for proteins or RNAs. Although some of these regions do contain crucial regulatory sequences, the vast majority of this DNA serves no known function. Typically, these regions of the genome are the ones in which the fastest change, in evolutionary terms, is observed, because there is typically little to no selection pressure acting on these regions to preserve their sequences.
In contrast, regions which code...
8.0K