SciML / SciML/JumpProcesses.jl
Block Search SSA (BiSSA)
Open
Nobody has claimed this yet.
enhancement
- Dominant language
- Julia
- Stars
- 150
- Forks
- 41
- Avg merge
- 1d 9h
- Merged PRs (30d)
- 28
Description
https://doi.org/10.1109/TCBB.2021.3070123
The exact tau-leaping method reports it can have better performance than RSSA-CR among exact Gillespie solvers for BCR and FCeri networks (though that method is even better they claim).
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Read the linked paper on Block Search SSA (BiSSA), then compare its exact tau-leaping approach with RSSA-CR and the reported BCR and FCeri networks. The issue names no repository files or tests; done would require a defined implementation scope and a way to evaluate the claimed performance.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- julia
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100