sc ores ▁method ▁pre fers ▁the ▁first ▁set , ▁because ▁ 6 5 + 4 0 ▁( 1 0 5 ) ▁is ▁greater ▁than ▁ 5 2 + 4 5 ( 9 7 ). ▁The ▁original ▁B LA ST ▁uses ▁the ▁Po isson ▁method ; ▁g apped ▁B LA ST ▁and ▁the ▁W U - B LA ST ▁uses ▁the ▁sum - of ▁scores ▁method . ▁ ▁Show ▁the ▁g apped ▁Smith - W at erman ▁local ▁align ments ▁of ▁the ▁query ▁and ▁each ▁of ▁the ▁matched ▁database ▁sequences . ▁ ▁The ▁original ▁B LA ST ▁only ▁generates ▁un - g apped ▁align ments ▁including ▁the ▁initially ▁found ▁H SP s ▁individually , ▁even ▁when ▁there ▁is ▁more ▁than ▁one ▁H SP ▁found ▁in ▁one ▁database ▁sequence . ▁ ▁B LA ST 2 ▁produces ▁a ▁single ▁alignment ▁with ▁g aps ▁that ▁can ▁include ▁all ▁of ▁the ▁initially ▁found ▁H SP ▁regions . ▁Note ▁that ▁the ▁computation ▁of ▁the ▁score ▁and ▁its ▁corresponding ▁E - value ▁involves ▁use ▁of ▁ade qu ate ▁gap ▁pen alt ies . ▁ ▁Report ▁every ▁match ▁whose ▁expect ▁score ▁is ▁lower ▁than ▁a ▁threshold ▁parameter ▁E . ▁ ▁Par allel ▁B LA ST ▁ ▁Par allel ▁B LA ST ▁versions ▁of ▁split ▁databases ▁are ▁implemented ▁using ▁M PI ▁and ▁P threads , ▁and ▁have ▁been ▁port ed ▁to ▁various ▁platforms ▁including ▁Windows , ▁Linux , ▁Sol aris , ▁Mac ▁OS ▁X , ▁and ▁A IX . ▁Popular ▁approaches ▁to ▁parallel ize ▁B LA ST ▁include ▁query ▁distribution , ▁hash