# similarityDistance

Compute distance profile between query and time series subsequences by evaluating z-normalized Euclidean distances

*Since R2024b*

## Syntax

## Description

`[___] = similarityDistance(___,EndPoints=`

specifies how to handle the length of the output vectors when `outputLengths`

)`X`

ends
with a partial subsequence. The choices are `"discard"`

, which discards the
elements corresponding to the partial subsequence, and `"fill"`

, which pads
the output vectors with additional `NaN`

values to match the length of
`X`

if `X`

actually does end with a full
subsequence.

Use this syntax with any of the input and output arguments in the previous syntaxes.

## Examples

## Input Arguments

## Output Arguments

## References

[1] Abdullah Mueen, Sheng Zhong, Yan
Zhu, Michael Yeh, Kaveh Kamgar, Krishnamurthy Viswanathan, Chetan Kumar Gupta, and Eamonn
Keogh, *The Fastest Similarity Search Algorithm for Time Series Subsequences under
Euclidean Distance*, 2022. https://www.cs.unm.edu/%7Emueen/FastestSimilaritySearch.html

## Version History

**Introduced in R2024b**