论文信息 - Pattern conserving data structure and algorithms for computations on dendritic trees.

Pattern conserving data structure and algorithms for computations on dendritic trees.

The linked list is offered as a pattern conserving data structure, useful for storing neuronal dendritic trees. A BASIC language algorithm is described. Modifications of this algorithm for building linked lists, graphing dendritic trees, and tarry ordering trees are presented. Brief mention is made of the last in first out stack as a alternative data structure for computations on dendritic trees.

W P Ireland | W. Ireland

[1] G. Leuba,et al. Development of dendritic patterns in the lateral geniculate nucleus of monkey: a quantitative Golgi study. , 1984, Brain research.

[2] B. Horwitz. Neuronal plasticity: how changes in dendritic architecture can affect the spread of postsynaptic potentials , 1981, Brain Research.

[3] L. W. Tucker,et al. Binary tree representation of three-dimensional, reconstructed neuronal trees: a simple, efficient algorithm. , 1986, Computer methods and programs in biomedicine.

[4] G. J. Smit,et al. The branching pattern in dendrites of cortical neurons. , 1972, Acta morphologica Neerlando-Scandinavica.

[5] A. Scheibel,et al. Quantitative analysis of the dendritic branching pattern of small pyramidal cells from adult rat somesthetic and visual cortex. , 1974, Experimental neurology.

[6] M. Berry,et al. The application of network analysis to the study of branching patterns of large dendritic fields , 1976, Brain Research.