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

Not an issue, but a question about uniqueByBestBitscore #1

Open
ESDeutekom opened this issue Jan 2, 2019 · 3 comments
Open

Not an issue, but a question about uniqueByBestBitscore #1

ESDeutekom opened this issue Jan 2, 2019 · 3 comments

Comments

@ESDeutekom
Copy link

Hi EnzoAndree,
Thanks a lot for the parser. It is extremely useful. I am working on one myself, but it is not that easy unfortunately. Then I stumbled upon your parser. I had a question though, about uniqueByBestBitscore. What is "the technical stuff" that makes is impossible to use uniqueByBestBitscore on hmmsearch output? I just happen to have the hmmsearh output and since the data is just too large, I cannot just rerun to get hmmscan output ( hmmscan is also not recommended on large data). And does your parser take into account best non-overlapping hits? Is that what this function does?
Thank you in advance!

Kind regards,
Eva

@SergeyBaikal
Copy link

I compared the results of the filtering (-u) and apparently the output of the program is not the best bitscore.

@EnzoAndree
Copy link
Owner

Hey! I completely forget about this question. @SergeyBaikal maybe is better to use this package in python https://github.com/althonos/pyhmmer is much better than mine

@SergeyBaikal
Copy link

EnzoAndree, Good afternoon! Wow, how unexpected to see a response given the last date of this question :) Thank you very much for the link. But I will say that I liked your script for its simplicity.

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

3 participants