▁faster ▁than ▁B LA ST . ▁ ▁Compar ing ▁B LA ST ▁and ▁the ▁Smith - W at erman ▁Process ▁▁ ▁While ▁both ▁Smith - W at erman ▁and ▁B LA ST ▁are ▁used ▁to ▁find ▁hom olog ous ▁sequences ▁by ▁searching ▁and ▁comparing ▁a ▁query ▁sequence ▁with ▁those ▁in ▁the ▁databases , ▁they ▁do ▁have ▁their ▁differences . ▁ ▁Due ▁to ▁the ▁fact ▁that ▁B LA ST ▁is ▁based ▁on ▁a ▁he ur istic ▁algorithm , ▁the ▁results ▁received ▁through ▁B LA ST , ▁in ▁terms ▁of ▁the ▁hits ▁found , ▁may ▁not ▁be ▁the ▁best ▁possible ▁results , ▁as ▁it ▁will ▁not ▁provide ▁you ▁with ▁all ▁the ▁hits ▁within ▁the ▁database . ▁B LA ST ▁miss es ▁hard ▁to ▁find ▁matches . ▁ ▁A ▁better ▁alternative ▁in ▁order ▁to ▁find ▁the ▁best ▁possible ▁results ▁would ▁be ▁to ▁use ▁the ▁Smith - W at erman ▁algorithm . ▁This ▁method ▁var ies ▁from ▁the ▁B LA ST ▁method ▁in ▁two ▁areas , ▁accuracy ▁and ▁speed . ▁The ▁Smith - W at erman ▁option ▁provides ▁better ▁accuracy , ▁in ▁that ▁it ▁finds ▁matches ▁that ▁B LA ST ▁cannot , ▁because ▁it ▁does ▁not ▁miss ▁any ▁information . ▁Therefore , ▁it ▁is ▁necessary ▁for ▁remote ▁hom ology . ▁However , ▁when ▁compared ▁to ▁B LA ST , ▁it ▁is ▁more ▁time ▁cons uming , ▁not ▁to ▁mention ▁that ▁it ▁requires ▁large ▁amounts ▁of ▁computer ▁usage ▁and ▁space . ▁However , ▁techn ologies ▁to ▁speed ▁up ▁the ▁Smith - W at erman ▁process ▁have ▁been ▁found