Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Compute table of hamming distances between all sequences #36

Closed
torognes opened this issue Aug 12, 2022 · 1 comment
Closed

Compute table of hamming distances between all sequences #36

torognes opened this issue Aug 12, 2022 · 1 comment
Assignees
Labels
enhancement New feature or request

Comments

@torognes
Copy link
Member

Computing the all-vs-all hamming distances between sequences in a set would be a useful feature, even if it is not very fast.

@torognes torognes added the enhancement New feature or request label Aug 12, 2022
@torognes torognes self-assigned this Aug 12, 2022
@torognes
Copy link
Member Author

torognes commented Feb 8, 2023

I've added the --distance option which will write the distance between the sequences to the pairs file when computing overlaps. This is usually the Hamming distance (minimum number of substitutions), unless the --indel (or `-i´) option is specified, in which case the distance is the Levenshtein distance (minimum number of substitutions or indels).

I hope this could serve a similar purpose.

@torognes torognes closed this as completed Feb 8, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant