-
Notifications
You must be signed in to change notification settings - Fork 49
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
Deterministic miRDeep2_core_algorithm.pl #65
base: master
Are you sure you want to change the base?
Conversation
The read with the highest frequency is used to determine the mature sequence of the candidate precursor. If 2 or more reads have the same frequency, one of them is chosen 'by random' due to the use of hashes. Now, the reads get additionally lexicographically ordered, making this process deterministic and replicable.
The signature is ordered according to begin and end position in the potential precursor. Now, they are additionally lexicographically ordered, making the output deterministic and replicable.
@Pfaendner: Thank you for the contribution and apologies for the long silence. |
For me the Perl seed is a quick and dirty solution with the disadvantage that its behaviour must not be preserved across different versions of Perl and that it is not very user friendly. Thus, I have made the code deterministic (including randfold) for my use-case. If you are interested in the code, please let me know. I am glad to provide it. |
@Pfaendner: That would be for @Drmirdeep to decide. AFAICT there was no interesting in this feature due to the additional maintenance burden. |
Ok. I will update this pull request until the end of next week. Thanks for your response, too! |
Modify miRDeep2_core_algorithm.pl basically at two sites: