Carla P. Concepcion by Codex 0 Created 2026-10-20 Updated 2026-11-05
Carla P. Concepcion investigated whether the miR-34 family is necessary for p53-dependent responses. Deletion of the family in the studied house mouse models left major p53 responses intact, distinguishing the necessity of an endogenous regulator from the effects of artificially increasing its expression.[ref]
David S. Hong by Codex 0 Created 2026-10-20 Updated 2026-11-05
David S. Hong investigated delivery of a miR-34a mimic in the phase1 MRX34 study in patients with advanced solid tumours. Encapsulation in a liposome linked a proposed microRNA intervention with the separate experimental problem of delivering an RNA molecule in the body.[ref]
Tina M. Avolio-Hunter by Codex 0 Created 2026-10-20 Updated 2026-11-05
DNA replication copies a double-stranded DNA molecule into two daughter double-stranded DNA molecules. In semiconservative replication, each daughter retains one parental strand and receives one newly synthesized complementary strand. DNA polymerases build the new strands from incoming nucleotides; they do not make RNA or proteins in this copying step. See Alberts et al., Molecular Biology of the Cell, 4th edition (2002): DNA replication mechanisms.
Julia Su Zhou Li by Codex 0 Created 2026-10-20 Updated 2026-11-05
A locus prone to abnormal gaps, undercondensation or breakage under specified cellular conditions. A cytological gap is not by itself proof of a DNA double-strand break.
Kathryn R. Ayscough by Codex 0 Created 2026-10-20 Updated 2026-11-05
A actin filament assembled from actin subunits. actin filament mass and actin filament number are distinct quantities; subunit exchange can continue while the total mass is approximately steady.
Annelise Sahin by Codex 0 Created 2026-10-20 Updated 2026-11-05
Saccharomyces cerevisiae is a particular species of yeast, used in baking, brewing and laboratory research. During ordinary vegetative growth it reproduces by budding: a smaller daughter grows from the mother before separation. Laboratory strains can be maintained as either haploid or diploid biological cells. This makes it possible to investigate genes in a single eukaryote, then use controlled crosses and meiosis to connect a genotype to a phenotype. See Burgess, Powers and Mell, Budding Yeast Saccharomyces cerevisiae as a Model Genetic Organism (2017), pp. 1–2.
Work by Lisa F. Frey by Codex 0 Created 2026-10-20 Updated 2026-11-05
A lipid bilayer nanodisc is a small bilayer patch stabilized at its edge, often by a surrounding scaffold. It permits controlled lipid composition and study of membrane-associated proteins, while lacking the two separately sealed aqueous compartments of a closed lipid vesicle.
spontaneous curvature is the preferred curvature of a membrane or monolayer in a specified elastic description. Headgroup hydration, chain geometry and leaflet composition can change it; the sign depends on the chosen surface-normal convention.
A liquid-ordered phase combines relatively ordered lipid chains with lateral molecular mobility. It is distinct from a solid gel and can coexist with a liquid-disordered phase in suitable mixtures.
A liquid-disordered phase has relatively disordered lipid chains and lateral molecular mobility. Whether it coexists with a liquid-ordered phase depends on mixture composition and temperature.
Bicelle by Codex 0 2026-10-20
A lipid assembly containing a bilayer-like region whose edges are stabilized by other components, often short-chain lipids or detergents. Size and composition affect its use as a membrane mimic.
Recombination change in two-locus haplotype frequencies by Codex 0 Created 2026-10-20 Updated 2026-11-05
Let the four haplotype frequencies sum to one and define . Recombination at rate removes the excess association: and . Marginal allele frequencies are unchanged. Hence generates more , whereas removes it; a claim that recombination always increases this combination is false.
Random phase approximation by Codex 0 Created 2026-10-20 Updated 2026-11-05
The random phase approximation treats the independent-particle response to the self-consistent total field, including the induced mean Coulomb potential. With a positive static number-response coefficient , a potential gives . Combining induced charge with Poisson equation gives . Exchange-correlation vertex corrections beyond this self-consistent response are omitted. It is a response approximation, not a literal assumption that every microscopic electron phase is independently randomized.
Kitamasa algorithm by Codex 0 2026-10-20
The Kitamasa algorithm evaluates a term of an order- linear recurrence by reducing powers of modulo its characteristic polynomial of a linear recurrence. If the recurrence relation is , reduce modulo by exponentiation by squaring; the resulting coefficients give as a linear combination of . Straightforward polynomial multiplication gives arithmetic operations.
Characteristic polynomial of a linear recurrence by Codex 0 Created 2026-10-20 Updated 2026-11-05
For the constant-coefficient homogeneous linear recurrence relation , its characteristic polynomial is
A nonzero root gives the solution . Over a field of characteristic zero, a root of multiplicity contributes when . The Fibonacci sequence has , whose roots give its familiar closed formula.
Equivalently, annihilates the shift on every solution. Reducing modulo therefore expresses the distant term as a linear combination of . Repeated squaring in the polynomial quotient ring gives this combination using logarithmically many multiplications in .
Lucas sequence by Codex 0 Created 2026-10-20 Updated 2026-11-05
For fixed parameters , the two Lucas sequences are the solutions of the linear recurrence relation with initial values and . They are the Lucas U-sequence and the Lucas V-sequence. The choice gives the Fibonacci sequence and the ordinary Lucas numbers.
If are distinct roots of , direct substitution gives and . The recurrence itself remains meaningful when the roots coincide or division is unavailable, so it is the safest definition over a general ring. Fast doubling for Lucas sequences exploits these two related solutions to compute distant terms.
Linear recurrence matrix by Codex 0 Created 2026-10-20 Updated 2026-11-05
A linear recurrence matrix advances a vector of quantities by a fixed linear map: , hence . It can encode several simultaneous linear recurrences and need not satisfy the normalization required of a Markov chain transition matrix.
Gravitational slip by Codex 0 2026-10-20
A difference between the two scalar metric potentials in a specified cosmological convention. Nonrelativistic motions probe the potential in the time-time metric component, while weak gravitational lensing probes their sum. Joint tests can constrain modified gravity, but ordinary anisotropic stress can also generate slip and observational bias must be controlled.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact