### 6 releases (breaking)

0.5.3 | Mar 8, 2023 |
---|---|

0.4.0 | May 29, 2020 |

0.3.0 | May 1, 2020 |

0.2.0 | Apr 30, 2020 |

0.1.1 | Apr 23, 2020 |

#**2** in #neuroscience

**23** downloads per month

**GPL-3.0**license

80KB

2K
SLoC

# nblast-rs

Implementation of NBLAST for neuron morphology comparisons, originally published here and implemented here.

This package is compatible with the reference implementation, but the API is subject to change.

## Benchmarking

Some benchmarks use optional features, and so benchmarkers should use

`cargo`` bench`` --`all-features

###
`lib.rs`

:

Implementation of the NBLAST algorithm for quantifying neurons' morphological similarity. Originally published in Costa et al. (2016) and implemented as part of the NeuroAnatomy Toolbox.

# Algorithm

Each neuron is passed in as a point cloud sample (the links between the points are not required).
A tangent vector is calculated for each point, based on its location and that of its nearest neighbors.
Additionally, an

value is calculated, which describes how colinear the neighbors are,
between 0 and 1.`alpha`

To query the similarity of neuron

to neuron `Q`

:`T`

- Take a point and its associated tangent in
`Q`- Find the nearest point in

, and its associated tangent`T` - Compute the distance between the two points
- Compute the absolute dot product of the two tangents
- Apply some empirically-derived function to the (distance, dot_product) tuple
- As published, this is the log probabity ratio of any pair belonging to closely related or unrelated neurons

- Find the nearest point in
- Repeat for all points, summing the results

The result is not easily comparable:
it is highly dependent on the size of the point cloud
and is not commutative, i.e.

.`f``(`Q`,` T`)` `!=` `f``(`T`,` Q`)`

To make queries between two pairs of neurons comparable,
the result can be normalized by the "self-hit" score of the query, i.e.

.`f``(`Q`,` Q`)`

To make the result commutative, the forward

and backward `f``(`Q`,` T`)`

scores can be combined in some way.
This library supports several means (arithmetic, harmonic, and geometric), the minimum, and the maximum.
The choice will depend on the application.
This can be applied after the scores are normalized.`f``(`T`,` Q`)`

The backbone of the neuron is the most easily sampled and most stereotyped part of its morphology, and therefore should be focused on for comparisons. However, a lot of cable is in dendrites, which can cause problems when reconstructed in high resolution. Queries can be weighted towards straighter, less branched regions by multiplying the absolute dot product for each point match by the geometric mean of the two alpha values.

More information on the algorithm can be found here.

# Usage

The QueryNeuron and TargetNeuron traits
define types which can be compared with NBLAST.
All

s are also `TargetNeuron`

s.
Both are Neurons.`QueryNeuron`

PointsTangentsAlphas and RStarTangentsAlphas implement these, respectively. Both can be created with pre-calculated tangents and alphas, or calculate them on instantiation.

The NblastArena contains a collection of

s
and a function to apply to pointwise DistDots to generate
a score for that point match, for convenient many-to-many comparisons.
A pre-calculated table of point match scores can be converted into a function with table_to_fn.`TargetNeuron`

#### Dependencies

~5MB

~106K SLoC