Radical Chain-Growth Polymerization: Chain Branching
Long-patch Base Excision Repair
Parseval's Theorem
Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule
Parseval's Theorem for Fourier transform
Olefin Metathesis Polymerization: Ring-Opening Metathesis Polymerization (ROMP)
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Updated: Aug 12, 2025

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
Published on: November 25, 2015
Recursive prefix-free parsing significantly reduces memory usage for building run-length encoded Burrows-Wheeler Transforms (BWT). This novel approach optimizes parse size for large, repetitive inputs, improving scalability.
Area of Science:
Background:
Conclusions: