-
Notifications
You must be signed in to change notification settings - Fork 4
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
(Just a suggestion, strictly speaking, it's not a bug) When there is no stop codon at the end of the sequence, the length of the ORF may not be divisible by 3 #4
Comments
Hi, please submit a pull request. |
Hi, I've forked a piece of code and completed most of the modifications. During the revision process, I noticed another problem: if remove_nested:
unnested_orfs = list()
for orf_1 in orfs:
appendable = True
for orf_2 in orfs:
# Are you sure the following code is correct?
# The reverse sequence of the start and end values has not been converted here.
# Could this comparison be incorrect?
if orf_2["start"] < orf_1["start"] and orf_2["end"] > orf_1["end"] and orf_1["end"] != -1:
appendable = False
break
if appendable:
unnested_orfs.append(orf_1)
orfs = unnested_orfs |
Have you done any unit tests on the code? Please submit a proper pull request and not just fork the code. |
Yes, I learned that I needed to fork a copy of the code to my GitHub repository, commit a change, and then request a pull. |
Finally, the testing is complete, and I expect to submit the pull request tomorrow afternoon. 🥳 |
Hi, I've submitted the pull request. Please review the code closely and let me know if anything is wrong or unexpected. |
The code that should be modified is shown in the figure
The text was updated successfully, but these errors were encountered: