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

Add the (optional) triplet algorithm for BuildShape #10

Merged
merged 1 commit into from
Aug 29, 2024

Conversation

dcdehaas
Copy link
Collaborator

Use --bs-triplet <count> to enable it for <count> iterations. Instead of just intersecting the children A, B to produce an "ancestral" haplotype, also produce both differences (A-B) and (B-A). These nodes in a very rough (greedy) sense represent potential recombinations. This causes BuildShape to run slower, but can speedup MapMutations.

Also switched from using murmur32 to std::hash, and the input to the hash is simplified.

There is some code duplication between bf_hash.h and hap_helpers.h which I need to cleanup at some point.

Use `--bs-triplet <count>` to enable it for `<count>` iterations.
Instead of just intersecting the children A, B to produce an
"ancestral" haplotype, also produce both differences (A-B) and
(B-A). These nodes in a very rough (greedy) sense represent potential
recombinations. This causes BuildShape to run slower, but can
speedup MapMutations.

Also switched from using murmur32 to std::hash, and the input to
the hash is simplified.

There is some code duplication between bf_hash.h and hap_helpers.h
which I need to cleanup at some point.
@dcdehaas dcdehaas merged commit 443c89f into main Aug 29, 2024
3 checks passed
@dcdehaas dcdehaas deleted the triplet_algorithm branch August 29, 2024 16:16
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant