#### Filter Results:

#### Publication Year

1977

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Brain Region

#### Cell Type

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- N Spassky, C Goujet-Zalc, +8 authors J L Thomas
- The Journal of neuroscience : the official…
- 1998

The plp gene encodes the proteolipid protein and its alternatively spliced product DM-20, major proteins of CNS myelin. In the mouse, plp/dm-20 transcripts are expressed beginning at embryonic day 9.5 (E9.5) by restricted foci of germinative neuroepithelial cells. To determine the identity of the neural precursors expressing plp/dm- 20, a zeomycin… (More)

The dorsal cochlear nucleus (DCN) of mammals displays a cortical structure containing a number of cell types organized into distinct layers. In the present study, the migratory mode of large multipolar cells and granule cells as well as the morphological differentiation of the projection neurons were investigated in the development of the mouse DCN. The… (More)

- Oleg V. Borodin, Anna O. Ivanova
- Discrete Mathematics
- 2009

- V. A. Aksenov, Oleg V. Borodin, Anna O. Ivanova
- Electr. J. Comb.
- 2015

We prove precise upper bounds for the minimum weight of a path on three vertices in several natural classes of plane graphs with minimum degree 2 and girth g from 5 to 7. In particular, we disprove a conjecture by S. Jendrol' and M. Maceková concerning the case g = 5 and prove the tightness of their upper bound for g = 5 when no vertex is adjacent to more… (More)

- Anna Ivanova, Eiko Nakahira, +7 authors Kazuhiro Ikenaka
- Journal of neuroscience research
- 2003

The existing view is that cortical oligodendrocytes (OLs) in rodents are born from the cortical subventricular zone (SVZ) after birth, but recent data suggest that many forebrain oligodendrocyte progenitor cells (OPCs) are specified much earlier (between E9.5 and E13.5 in the mouse) in the ventricular zone of the ventral forebrain under the control of sonic… (More)

- M Yamada, A Ivanova, Y Yamaguchi, M B Lees, K Ikenaka
- The Journal of neuroscience : the official…
- 1999

A gene encoding myelin proteolipid protein (PLP) and its smaller isoform DM20 is expressed at least 1 week before myelination. Mutations within the gene cause abnormalities in the development of premyelinating oligodendrocytes, resulting in hypomyelinating disorders. These findings suggest a premyelinating function of the PLP gene products. We previously… (More)

Oligodendrocytes are the myelinating cells of the mammalian central nervous system. In the mouse spinal cord, oligodendrocytes are generated from strictly restricted regions of the ventral ventricular zone. To investigate how they originate from these specific regions, we used an explant culture system of the E12 mouse cervical spinal cord and hindbrain. In… (More)

- Alejandro D Roth, Anna Ivanova, David R Colman
- Neuron glia biology
- 2006

Myelin formation and maintenance depends on the establishment of two structurally and biochemically discernible domains: (a)compact myelin, that is multilamellar stacks of plasma membrane sheets; and (b) cytoplasmic channels that border the compact myelin domains, attach them to the cell body and anchor the myelin sheath to the axonal membrane. To identify… (More)

- Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud
- Journal of Graph Theory
- 2010

A graph G is (k, 0)-colorable if its vertices can be partitioned into subsets V1 and V2 such that in G[V1] every vertex has degree at most k, while G[V2] is edgeless. For every integer k ≥ 1, we prove that every graph with the maximum average degree smaller than 3k+4 k+2 is (k, 0)-colorable. In particular, it follows that every planar graph with girth at… (More)

- Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, André Raspaud
- Discrete Applied Mathematics
- 2011

A graph G is called (k, 1)-colorable, if the vertex set of G can be partitioned into subsets V1 and V2 such that the graph G[V1] induced by the vertices of V1 has maximum degree at most k and the graph G[V2] induced by the vertices of V2 has maximum degree at most 1. We prove that every graph with a maximum average degree less than 10k+22 3k+9 admits a (k,… (More)