Thank you, Dr Langmead for these great lectures. I am really happy to see the recent activity in your RUclips channel. I honestly never watcched someone who can spell out bioinformatics problems as easy as you. This is a thank you note for all online lectures you posted, especially the Coursera course. It is really a corner stone in my understanding of bioinformatics and many of my colleagues in Egypt.
I think it's because the size of the two sets can be different, you need to pick a method that will work if one is significantly smaller than the other.
Thank you, Dr Langmead for these great lectures. I am really happy to see the recent activity in your RUclips channel. I honestly never watcched someone who can spell out bioinformatics problems as easy as you.
This is a thank you note for all online lectures you posted, especially the Coursera course. It is really a corner stone in my understanding of bioinformatics and many of my colleagues in Egypt.
best explanation about minhash for set intersection est. i have come encountered. thanks
Good Video helped me a lot! Please make more videos! how do we decide on the number of hash functions or partitions as explained in the last slide?
It helps me a lot! Thank you!
Thank you, super helpful!
Beautiful.
Picking the k lowest hashes implies sorting. Why can't I just pick k random hashes; wouldn't that be faster?
I think it's because the size of the two sets can be different, you need to pick a method that will work if one is significantly smaller than the other.
other resources random permutation to achieve this
First again🙏🙏😊
The motivation for hashing was not made clear.
Its to get an uniform random value. Out of these random values you can pick the 8 minimum hashes.