Not an issue, but a question about uniqueByBestBitscore
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
I compared the results of the filtering (-u) and apparently the output of the program is not the best bitscore.
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
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.