Epigenetic Profiling Reveals a Developmental Decrease in Promoter Accessibility During Cortical Maturation in vivo

Axon regeneration in adult central nervous system (CNS) is limited in part by a developmental decline in the ability of injured neurons to re-express needed regeneration associated genes (RAGs). Adult CNS neurons may lack appropriate pro-regenerative transcription factors, or may display chromatin structure that restricts transcriptional access to RAGs. Here we performed epigenetic profiling around the promoter regions of key RAGs, and found progressive restriction across a time course of cortical maturation. These data identify a potential intrinsic constraint to axon growth in adult CNS neurons. Neurite outgrowth from cultured postnatal cortical neurons, however, proved insensitive to treatments that improve axon growth in other cell types, including combinatorial overexpression of AP1 factors, overexpression of histone acetyltransferases, and pharmacological inhibitors of histone deacetylases. This insensitivity could be due to intermediate chromatin closure at the time of culture, and highlights important differences in cell culture models used to test potential pro-regenerative interventions

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity

The Application of CRISPR Technology to High Content Screening in Primary Neurons

Axon growth is coordinated by multiple interacting proteins that remain incompletely characterized. High content screening (HCS), in which manipulation of candidate genes is combined with rapid image analysis of phenotypic effects, has emerged as a powerful technique to identify key regulators of axon outgrowth. Here we explore the utility of a genome editingapproach referred to as CRISPR (Clustered Regularly Interspersed Palindromic Repeats) for knockout screening in primary neurons. In the CRISPR approach a DNA-cleaving Cas enzyme is guided to genomic target sequences by user-created guide RNA (sgRNA), where it initiates a double-stranded break that ultimately results in frameshift mutation and loss of protein production. Using electroporation of plasmid DNA that co-expresses Cas9enzyme and sgRNA, we first verified the ability of CRISPR targeting to achieve protein-level knockdown in cultured postnatal cortical neurons. Targeted proteins included NeuN (RbFox3) and PTEN, a well-studied regulator of axon growth. Effective knockdown lagged at least four days behind transfection, but targeted proteins were eventually undetectable by immunohistochemistry in \u3e 80% of transfected cells. Consistent with this, anti-PTEN sgRNA produced no changes in neurite outgrowth when assessed three days post-transfection. When week-long cultures were replated, however, PTEN knockdown consistently increased neurite lengths. These CRISPR-mediated PTEN effects were achieved using multi-well transfection and automated phenotypic analysis, indicating the suitability of PTEN as a positive control for future CRISPR-based screening efforts. Combined, these data establish an example of CRISPR-mediated protein knockdown in primary cortical neurons and its compatibility with HCS workflows

On the binary codes with parameters of triply-shortened 1-perfect codes

We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary $(n=2^m-3, 2^{n-m-1}, 4)$ code $C$, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of an equitable partition of the $n$-cube into six cells. An arbitrary binary $(n=2^m-4, 2^{n-m}, 3)$ code $D$, i.e., a code with parameters of a triply-shortened Hamming code, is a cell of an equitable family (but not a partition) from six cells. As a corollary, the codes $C$ and $D$ are completely semiregular; i.e., the weight distribution of such a code depends only on the minimal and maximal codeword weights and the code parameters. Moreover, if $D$ is self-complementary, then it is completely regular. As an intermediate result, we prove, in terms of distance distributions, a general criterion for a partition of the vertices of a graph (from rather general class of graphs, including the distance-regular graphs) to be equitable. Keywords: 1-perfect code; triply-shortened 1-perfect code; equitable partition; perfect coloring; weight distribution; distance distributionComment: 12 page

KLF6 and STAT3 Co-Occupy Regulatory DNA and Functionally Synergize to Promote Axon Growth in CNS Neurons

The failure of axon regeneration in the CNS limits recovery from damage and disease. Members of the KLF family of transcription factors can exert both positive and negative effects on axon regeneration, but the underlying mechanisms are unclear. Here we show that forced expression of KLF6 promotes axon regeneration by corticospinal tract neurons in the injured spinal cord. RNA sequencing identified 454 genes whose expression changed upon forced KLF6 expression in vitro, including sub-networks that were highly enriched for functions relevant to axon extension including cytoskeleton remodeling, lipid synthesis, and bioenergetics. In addition, promoter analysis predicted a functional interaction between KLF6 and a second transcription factor, STAT3, and genome-wide footprinting using ATAC-Seq data confirmed frequent co-occupancy. Co-expression of the two factors yielded a synergistic elevation of neurite growth in vitro. These data clarify the transcriptional control of axon growth and point the way toward novel interventions to promote CNS regeneration

Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes

The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. \"Osterg{\aa}rd and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I - Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such (13,512,3) codes. By applying a switching operation to those codes, two more (13,512,3) codes are obtained, which are then not doubly shortened perfect codes.Comment: v2: a correction concerning shortened codes of length 1

The Tumor Suppressor HHEX Inhibits Axon Growth when Prematurely Expressed in Developing Central Nervous System Neurons

Neurons in the embryonic and peripheral nervoussystem respond to injury by activating transcriptional programs supportive of axon growth, ultimately resulting in functional recovery. In contrast, neurons in the adult central nervous system (CNS) possess a limited capacity to regenerate axons after injury, fundamentally constraining repair. Activating pro-regenerative gene expression in CNS neurons is a promising therapeutic approach, but progress is hampered by incomplete knowledge of the relevant transcription factors. An emerging hypothesis is that factors implicated in cellular growth and motility outside the nervous system may also control axon growth in neurons. We therefore tested sixty-nine transcription factors, previously identified as possessing tumor suppressive or oncogenic properties in non-neuronal cells, in assays of neurite outgrowth. This screen identified YAP1 and E2F1 as enhancers of neurite outgrowth, and PITX1, RBM14, ZBTB16, and HHEX as inhibitors. Follow-up experiments are focused on the tumor suppressor HHEX, one of the strongest growth inhibitors. HHEX is widely expressed in adult CNS neurons, including corticospinal tract neurons after spinal injury, but is present only in trace amounts in immature cortical neurons and adult peripheral neurons. HHEX overexpression in early postnatal cortical neurons reduced both initial axonogenesis and the rate of axon elongation, and domain deletion analysis strongly implicated transcriptional repression as the underlying mechanism. These findings suggest a role for HHEX in restricting axon growth in the developing CNS, and substantiate the hypothesis that previously identified oncogenes and tumor suppressors can play conserved roles in axon extension

List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes

A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are Reed-Solomon codes. We extend this list decoding algorithm for matrix-product codes with polynomial units, which are quasi-cyclic codes. Furthermore, it allows us to consider unique decoding for matrix-product codes with polynomial units