Blast: The Algorithm

Disclaimer: "The information in this module is accurate and complete to the best of our knowledge. All recommendations are made without guarantee on the part of the author or the sponsoring institutions. The author and the sponsoring institutions disclaim any liability in connection with the use of this information."
For more information about PRINBRE, please visit our webpage: inbre.hpcf.upr....
Or request access to the PRINBRE Moodle LMS platform: prinbrex.hpcf....

[@SonDVo]

Great video. Explanation with video is far more understandable than reading algorithms in papers (although it can be less comprehensive)

[@yellowspirit9370]

Excelente video, hacer ver este tema muy claro.

[@yoongicorn7973]

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?

[@nickpricekefwjF]

Great explanation, but remove annoying music from your videos!!!

[@thepierre2009]

it helps me stay awake

[@abdullahfaqihalmubarok8232]

really helpful!

[@PedroTorres-mn2jn]

Would you care providing references for the implementation of the tree-searching matching in BLAST?

[@nickpricekefwjF]

You have the "Pre-process database" across all slides which is confusing

[@mahmud8982]

please remove the annoying music...

[@dimitrismwrakis6910]

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!