Description Usage Arguments Details
The first sequence in the input data is chosen and the pairwise distances between all sequences and this sequence is computed. The sequence most distant from the first sequence is then chosen as the next anchor. The process continues by selecting the sequence furthest from all previous anchors as the next anchor.
1 | fast_stringDist(x, anchors = 3)
|
x |
The input sequences |
anchors |
The number of sequences to use as anchors |
Once all the distances to the chosen number of anchors have been computed, a distance matrix is constructed using the distances between the sequences and the anchors. For very large numbers of sequences (>500) this realizes a big speedup.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.