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

LazyPartition #21

Merged
merged 25 commits into from
Jun 13, 2024
Merged

LazyPartition #21

merged 25 commits into from
Jun 13, 2024

Conversation

nossleinad
Copy link
Collaborator

@nossleinad nossleinad commented May 16, 2024

Introduces LazyPartition

Summary

With this data structure, you can wrap a partition of choice.
The idea is that in some message passing algorithms, there is only a wave of partitions which need to actualize.
For instance, a wave following a root-leaf path, or a depth-first traversal.
In which case, we can be more economical with our memory consumption.
With a worst case memory complexity of O(log(n)), where n is the number of nodes, functionality is provided for:

  • log_likelihood!
  • felsenstein!
  • sample_down
    (Further functionality is under development)

Documentation

An example of how to use LazyPartition is provided in https://github.com/nossleinad/MolecularEvolution.jl/tree/LazyPartition/docs/src/models.md

Use case

An argument in favour of this PR is that LazyPartition could be integrated in the difFUBAR method with brevity, where it dramatically reduced the memory footprint of larger datasets. MurrellGroup/CodonMolecularEvolution.jl@b09b0c9

@nossleinad nossleinad merged commit 9c711c6 into MurrellGroup:main Jun 13, 2024
4 checks passed
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