A eukaryotic replicative polymerase with a predominant lagging-strand role, also participating in initiation, strand displacement and repair contexts.
An E. coli polymerase participating in primer removal and gap filling, distinct from the principal chromosomal replicase DNA polymerase III.
The eukaryotic MSH2–MSH6 mismatch-recognition complex, acting on base mismatches and many small insertion–deletion loops.
The eukaryotic MSH2–MSH3 complex, with an important role in recognition of larger insertion–deletion loops.
An enzyme involved in methyl-directed DNA mismatch repair in E. coli. This mechanism should not be generalized to eukaryotic daughter-strand discrimination.
Its activity helps copy a CG methylation pattern after DNA replication. Reduced MET1 function can therefore change heritable chromatin states while leaving the corresponding DNA base order unchanged; this separates an epigenetic mark from a sequence mutation. [ref]
Molecular Biology of the Cell, 4th edition by Bruce Alberts and others. Chapters 4–7, chromatin, replication and gene regulation
Recognition of chromatin state helps couple DNA methylation to histone methylation, reinforcing a locally repressive environment. This is an interaction between two kinds of molecular mark, rather than conversion of one mark into the other. [ref]
Non-CG methylation patterns shape the epigenetic landscape in Arabidopsis by Hume Stroud and others. 2014, chromomethylases and non-CG methylation
This complements other plant methylation systems that act preferentially in different sequence or chromatin contexts. Separating CHH methylation from symmetric CG or CHG contexts is important because the patterns have different maintenance requirements after replication. [ref]
A methyltransferase recruited by RNA-directed DNA methylation that can establish methylation in multiple cytosine sequence contexts.
A plant DNA glycosylase/lyase involved in active DNA demethylation through a repair-associated pathway.
Active replacement can counterbalance methylation-dependent silencing at selected loci. This differs from passive dilution of a mark during replication, because the modified base is enzymatically removed through a repair-linked pathway. [ref]
ROS1, a repressor of transcriptional gene silencing in Arabidopsis, encodes a DNA glycosylase/lyase by Zhizhong Gong and others. 2002, glycosylase/lyase activity and silencing phenotype
A plant DNA glycosylase involved in reproductive epigenetic reprogramming and maternal imprinting effects.
Physical discontinuity of a chromosome. Fluorescent locus splitting or undercondensation can suggest vulnerability but needs additional evidence before being equated with a break.
Two distinct positive integers are amicable when the sum of the proper divisors of is and the sum of the proper divisors of is . The pair is an example. Iterating the proper-divisor sum can also produce longer directed cycles.
The perfection quotient of a positive integer is the ratio , where is the sum-of-divisors function. It distinguishes the three familiar classes: a deficient number has quotient below two, a perfect number has quotient two, and an abundant number has quotient above two. For example, the quotients of , and are , and .
For coprime integers , the quotient is multiplicative, since . At a prime power, its factor isConsequently a prescribed quotient can be studied one prime power at a time, tracking the remaining numerator and denominator.
A pair of positive integers with for a specified positive integer . Pairing each divisor with gives unordered factor pairs for nonsquare , and for a perfect square, where is the divisor function.
A divisor of a positive integer is unitary when . Each prime power in the prime factorization of must therefore be included in completely or omitted completely. Consequently, the sum of the -th powers of unitary divisors is .
A positive divisor of a positive integer is bi-unitary when the greatest common unitary divisor of and is . The comparison uses unitary divisors, so it differs from requiring the ordinary greatest common divisor to be one.
For with a prime number and , consider , where . The only possible nontrivial common unitary divisor of and occurs when . Consequently every divisor is bi-unitary except when is even.
For example, the bi-unitary divisors of are ; only is excluded. Its unitary divisors are just and , showing that these two notions differ substantially. For a general positive integer, apply the prime-power condition independently to each prime factor in its prime factorization.
The positive divisors of a positive integer , ordered by divisibility, form a lattice. The greatest lower bound of is , their greatest common divisor; the least upper bound is , their least common multiple. Both are again divisors of .
For example, the positive divisors of are . The divisors and are incomparable under divisibility, but their greatest lower bound is and their least upper bound is . The bottom and top elements of the whole lattice are and , respectively. Under prime factorization, the two operations take the coordinatewise minimum and maximum of the prime exponents.
There are unlisted articles, also show them or only show them.