I think there is some mistake while building the binary search tree. Like in the left subtree of the root node, we are left with 6 nodes which is even number of nodes. So we select the higher-mid that is "15" as the left child. But for the right subtree, again we get even number of nodes to choose mid from, then we should take "53" and not "40". Don't you think so?
Not good explanation, especially in the search trees and you also have mistakes at the values of keys in the 3-mers within HSSP threshold. For example key for CTC = 29 and not 45. There are alo other mistakes. Sorry man thumbs down!
![PR-INBRE BiRC [Bioinformatics Resources Core]](http://yt3.ggpht.com/ytc/AIdro_nI-ACFJwzFiI1ZxD0oe1fxATxsX9lBiGeF82dXVsR-sw=s48-c-k-c0x00ffffff-no-rj)
Great video. Explanation with video is far more understandable than reading algorithms in papers (although it can be less comprehensive)
I think there is some mistake while building the binary search tree. Like in the left subtree of the root node, we are left with 6 nodes which is even number of nodes. So we select the higher-mid that is "15" as the left child. But for the right subtree, again we get even number of nodes to choose mid from, then we should take "53" and not "40". Don't you think so?
Great explanation, but remove annoying music from your videos!!!
it helps me stay awake
Would you care providing references for the implementation of the tree-searching matching in BLAST?
You have the "Pre-process database" across all slides which is confusing
really helpful!
Excelente video, hacer ver este tema muy claro.
please remove the annoying music...
Not good explanation, especially in the search trees and you also have mistakes at the values of keys in the 3-mers within HSSP threshold. For example key for CTC = 29 and not 45. There are alo other mistakes. Sorry man thumbs down!