FASTAptamer-Cluster uses the Levenshtein algorithm to cluster together closely-related sequences based on a user-defined edit distance (the minimum number of insertions, deletions, or subsitutions required to transform one string into another).
|
hg clone https://toolshed.g2.bx.psu.edu/repos/fastaptamer/fastaptamer_cluster
Name | Description | Version | Minimum Galaxy Version |
---|---|---|---|
Cluster closely-related sequences using Levenshtein edit distance. | 1.0.2 | any |