▁the ▁text ▁and ▁is ▁denoted ▁by ▁T . ▁Its ▁length ▁is ▁m . ▁ ▁An ▁alignment ▁of ▁P ▁to ▁T ▁is ▁an ▁index ▁k ▁in ▁T ▁such ▁that ▁the ▁last ▁character ▁of ▁P ▁is ▁aligned ▁with ▁index ▁k ▁of ▁T . ▁ ▁A ▁match ▁or ▁occurrence ▁of ▁P ▁occurs ▁at ▁an ▁alignment ▁if ▁P ▁is ▁equivalent ▁to ▁T [( k - n + 1 ).. k ]. ▁ ▁Description ▁The ▁Bo yer – Mo ore ▁algorithm ▁searches ▁for ▁occurr ences ▁of ▁ ▁in ▁ ▁by ▁performing ▁explicit ▁character ▁compar isons ▁at ▁different ▁align ments . ▁Instead ▁of ▁a ▁br ute - force ▁search ▁of ▁all ▁align ments ▁( of ▁which ▁there ▁are ▁), ▁Bo yer – Mo ore ▁uses ▁information ▁gained ▁by ▁pre processing ▁ ▁to ▁skip ▁as ▁many ▁align ments ▁as ▁possible . ▁ ▁Pre vious ▁to ▁the ▁introduction ▁of ▁this ▁algorithm , ▁the ▁usual ▁way ▁to ▁search ▁within ▁text ▁was ▁to ▁examine ▁each ▁character ▁of ▁the ▁text ▁for ▁the ▁first ▁character ▁of ▁the ▁pattern . ▁Once ▁that ▁was ▁found ▁the ▁subsequent ▁characters ▁of ▁the ▁text ▁would ▁be ▁compared ▁to ▁the ▁characters ▁of ▁the ▁pattern . ▁If ▁no ▁match ▁occurred ▁then ▁the ▁text ▁would ▁again ▁be ▁checked ▁character ▁by ▁character ▁in ▁an ▁effort ▁to ▁find ▁a ▁match . ▁Thus ▁almost ▁every ▁character ▁in ▁the ▁text ▁needs ▁to ▁be ▁exam ined . ▁ ▁The ▁key ▁insight ▁in ▁this ▁algorithm ▁is ▁that ▁if ▁the ▁end ▁of ▁the ▁pattern ▁is ▁compared ▁to ▁the ▁text , ▁then ▁j umps ▁along ▁the ▁text ▁can ▁be ▁made ▁rather