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

Algorithm for selecting best primer #5

Open
tthatcher95 opened this issue Mar 6, 2019 · 0 comments
Open

Algorithm for selecting best primer #5

tthatcher95 opened this issue Mar 6, 2019 · 0 comments

Comments

@tthatcher95
Copy link
Owner

tthatcher95 commented Mar 6, 2019

F = Number of times primer is in FG
B = Number of times primer is in BG
Ex = Exclusion penalty
C1 = First Scalar
C2 = -Scalar
Ra = Rolling Amplification (multiple primer sets are under the same stretch) = sum(Lfg) / sum(Lbg)
BestSet = C1 * sum(Temp) / n + C2 * sum(Ex trues) + Ra

After completing formula, rank from best to worst (individual score), then split data into x bins, randomly select 1 - x number, then randomly select a value inside that bin, then calculate the bestSet score for that set.

Then run this about 10000 times, and select the best one.

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

No branches or pull requests

1 participant