0000000000466143
AUTHOR
Rajeev Raman
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
A prefix normal word is a binary word with the property that no substring has more $1$s than the prefix of the same length. By proving that the set of prefix normal words is a bubble language, we can exhaustively list all prefix normal words of length $n$ as a combinatorial Gray code, where successive strings differ by at most two swaps or bit flips. This Gray code can be generated in $\Oh(\log^2 n)$ amortized time per word, while the best generation algorithm hitherto has $\Oh(n)$ running time per word. We also present a membership tester for prefix normal words, as well as a novel characterization of bubble languages.
Preventing Jacob-induced transcriptional inactivation of CREB protects synapses from β-amyloid in Alzheimer’s Disease
Abstract Disruption of transcriptional activity of cAMP–responsive element-binding protein (CREB), a master regulator of cell survival and plasticity-related gene expression, is a hallmark of Alzheimer’s disease (AD). CREB shut-off results in early synaptic dysfunction, contributes to AD pathology and eventually neuronal cell death and is elicited by amyloid-β (Aβ)-induced activation of extrasynaptic N-methyl-D-aspartate-receptors (NMDAR). In previous work we found that the protein messenger Jacob encodes and transduces the synaptic or extrasynaptic origin of NMDAR signals to the nucleus. In response to cell survival and plasticity-related synaptic NMDAR stimulation macromolecular transport…