Skip to content

openworm/VarshneyEtAl2011

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Structural Properties of the Caenorhabditis elegans Neuronal Network

Lav R. Varshney, Beth L. Chen, Eric Paniagua, David H. Hall, and Dmitri B. Chklovskii

Abstract

Despite recent interest in reconstructing neuronal networks, complete wiring diagrams on the level of individual synapses remain scarce and the insights into function they can provide remain unclear. Even for Caenorhabditis elegans, whose neuronal network is relatively small and stereotypical from animal to animal, published wiring diagrams are neither accurate nor complete and self-consistent. Using materials from White et al. and new electron micrographs we assemble whole, self-consistent gap junction and chemical synapse networks of hermaphrodite C. elegans. We propose a method to visualize the wiring diagram, which reflects network signal flow. We calculate statistical and topological properties of the network, such as degree distributions, synaptic multiplicities, and small-world properties, that help in understanding network signal propagation. We identify neurons that may play central roles in information processing, and network motifs that could serve as functional modules of the network. We explore propagation of neuronal activity in response to sensory or artificial stimulation using linear systems theory and find several activity patterns that could serve as substrates of previously described behaviors. Finally, we analyze the interaction between the gap junction and the chemical synapse networks. Since several statistical properties of the C. elegans network, such as multiplicity and motif distributions are similar to those found in mammalian neocortex, they likely point to general principles of neuronal networks. The wiring diagram reported here can help in understanding the mechanistic basis of behavior by generating predictions about future experiments involving genetic perturbations, laser ablations, or monitoring propagation of neuronal activity in response to stimulation.

Reference

L. R. Varshney, B. L. Chen, E. Paniagua, D. H. Hall, and D. B. Chklovskii, "Structural properties of the Caenorhabditis elegans neuronal network," PLoS Computational Biology, vol. 7, no. 2, e1001066, Feb. 2011. http://dx.doi.org/10.1371/journal.pcbi.1001066

Data

Here you can find the C. elegans connectivity data. See also WormAtlas.

C. elegans Connectivity Data
Adjacency matrices and neuron labels ConnOrdered_040903.mat
Neuron class labels NeuronTypeOrdered_040903.mat
Chemical synapse adjacency matrix under alternate send_joint quantitation A_sendjoint.mat

Code

Here you can find the code to compute several graph functionals and to reproduce figures and tables from the paper. If you use this code in your research and publications, please also put a reference to this paper. Thank you!

These files were developed with Matlab Version 7.4.0 (R2007a) on Microsoft Windows XP (Version 2002). Some use the Bioinformatics Toolbox 3.1.

Data Reading Utilities
Data reader general datareader.m
Listing of neurons with GABAergic synapses general GABA.m
Mathematical Utilities
Hurwitz zeta function general Hurwitz_zeta.m
Three Layer Architecture
Partitioning and visualization of adjacency matrices Figure 1 layers.m, layers_i.m
Total connectivity weight between different categories of neurons Tables S2, S4 layerconn.m
Visualization
Visualization of C. elegans wiring diagram Figure 2 visualize.m
Connected Components
Connected components of an undirected graph (gap junction) Table S1 conncomp_gap.m
Connected components of a directed graph (chemical) Table S5 conncomp_chem.m
Connected components of combined network conncomp_both.m
Degree Distribution
Degree distribution of an undirected graph (gap junction) Figure 3(a) degDist_gap.m
Degree distribution of a directed graph (chemical) Figures 6(a), 6(b), 6(c) degDist_chem.m
Correlations among degree sequences degDistCorr.m
Degree distribution of combined network Figure S4 degDist_both.m
Multiplicity Distribution
Multiplicity distribution of an undirected graph (gap junction) Figure 3(b) multDist_gap.m
Multiplicity distribution of a directed graph (chemical) Figure 6(d) multDist_chem.m
Number Distribution
Number distribution of an undirected graph (gap junction) Figure 3(c) numDist_gap.m
Number distribution of a directed graph (chemical) Figures 6(e), 6(f) numDist_chem.m
Small World Characteristics
Geodesic distance distribution of an undirected graph (gap junction) Figure S1(a) geodistDist_gap.m
Geodesic distance distribution of a directed graph (chemical) Figure S1(b) geodistDist_chem.m
Geodesic distance distribution of combined network Figure S1(c) geodistDist_both.m
Closeness centrality of an undirected graph (gap junction) closenesscentrality_gap.m
Closeness centrality of a directed graph (chemical) closenesscentrality_chem.m
Closeness centrality of combined network closenesscentrality_both.m
Characteristic path length of an undirected graph (gap junction) Table S3 pathlength_gap.m
Characteristic path length of a directed graph (chemical) pathlength_chem.m
Characteristic path length of combined network pathlength_both.m
Clustering coefficient of an undirected graph (gap junction) Table S3 clustcoef_gap.m
Clustering coefficient of a directed graph (chemical) clustcoef_chem.m
Clustering coefficient of combined network clustcoef_both.m
Linear Systems Analysis
Spectral properties for gap junction network Figures 4, S2, S3 LaplacianSpec_gap.m
Spectral properties for combined network Figure 8 Spec_both.m
Motifs
Doublet counts of a directed network (chemical) Figure 7(a) doubCount_chem.m
Triplet counts of an undirected network (gap junction) Figure 5(a) tripCount_gap.m
Triplet counts of a directed network (chemical) Figure 7(b) tripCount_chem.m
Conditional doublet counts of a directed network given an undirected network (chemical given gap junction) Figure 9(a) doubCount_joint.m
Conditional triplet counts of chemical network given gap junction network Figure 9(b) tripCount_joint.m, loopchoose.m
Robustness
Characteristic path length vitality of gap junction network pathlengthVitality_gap.m
Robustness characterization of gap junction network Table S6 robustness_gap.m
Robustness characterization of chemical network Table S7 robustness_chem.m
Robustness characterization of linear systems analysis for combined network Figure 10 spectral_both.m
Last Updated 2011

About

C. elegans connectome analysis

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • MATLAB 100.0%