{"id":268,"date":"2016-08-07T15:50:18","date_gmt":"2016-08-07T12:50:18","guid":{"rendered":"https:\/\/stwww1.weizmann.ac.il\/bioinformatics\/?p=268"},"modified":"2016-08-07T15:53:59","modified_gmt":"2016-08-07T12:53:59","slug":"blast-en","status":"publish","type":"post","link":"https:\/\/stwww1.weizmann.ac.il\/bioinformatics\/blast-en\/","title":{"rendered":"Blast"},"content":{"rendered":"

Basic Local Alignment Search Tool. (Altschul et al.) A sequence comparison algorithm optimized for speed used to search sequence databases for optimal local alignments to a query. The initial search is done for a word of length "W" that scores at least "T" when compared to the query using a substitution matrix. Word hits are then extended in either direction in an attempt to generate an alignment with a score exceeding the threshold of "S". The "T" parameter dictates the speed and sensitivity of the search.<\/p>\n

BLASTn<\/a><\/p>\n

BLAST2seq<\/a><\/p>","protected":false},"excerpt":{"rendered":"

Basic Local Alignment Search Tool. (Altschul et al.) A sequence comparison algorithm optimized for speed used to search sequence databases for optimal local alignments to a query. The initial search is done for a word of length "W" that scores … \u05dc\u05d4\u05de\u05e9\u05da \u05e7\u05e8\u05d9\u05d0\u05d4 ←<\/span><\/a><\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[8],"tags":[],"class_list":["post-268","post","type-post","status-publish","format-standard","hentry","category-english"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t