Directed intermittent search for a hidden target on a dendritic tree.

Area of Science:

• Computational neuroscience
• Biophysics
• Cell biology

Background:

• Active intracellular transport, driven by molecular motors, is crucial for neuronal function.
• Understanding search strategies in complex dendritic networks is key to deciphering neuronal communication.
• Previous models often focused on simpler, linear or finite transport pathways.

Purpose of the Study:

• To analyze a stochastic model of directed intermittent search within a neuronal dendritic tree network.
• To investigate the efficiency of different search strategies (unidirectional vs. bidirectional) for target localization.
• To determine conditions under which bidirectional search outperforms unidirectional search.

Main Methods:

• Developed a stochastic model simulating a particle searching within a tree-like dendritic structure.
• Particle exhibits intermittent behavior: switching between stationary search and biased forward motion.
• Employed Green's function methods to approximate the moment generating function for analysis.

Main Results:

• Calculated hitting probability and conditional mean first passage time to locate a synaptic target.
• Demonstrated that the particle's movement is biased in the forward direction during the mobile phase.
• Identified a specific parameter range where a bidirectional search strategy significantly enhances target-finding efficiency compared to unidirectional search.

Conclusions:

• The study provides insights into optimizing intracellular transport efficiency in complex neuronal architectures.
• Bidirectional search strategies offer a potentially more effective mechanism for target localization in dendritic trees.
• Findings contrast with previous models of finite interval transport, highlighting the importance of network topology.