▁United ▁Kingdom ▁Category : J uda ic ▁studies ▁Category : Al umn i ▁of ▁University ▁College ▁London ▁Category : A cadem ics ▁of ▁University ▁College ▁London ▁Category : Trans l ators ▁of ▁the ▁Bible ▁into ▁English ▁Category : J ew ish ▁transl ators ▁of ▁the ▁Bible ▁Category : 2 0 th - century ▁transl ators ▁Hermann ▁G oll an cz ▁Category : B ur ial s ▁at ▁Will es den ▁Jewish ▁C emetery <0x0A> </s> ▁In ▁computer ▁science , ▁the ▁Bo yer – Mo ore ▁string - search ▁algorithm ▁is ▁an ▁efficient ▁string - search ing ▁algorithm ▁that ▁is ▁the ▁standard ▁benchmark ▁for ▁practical ▁string - search ▁literature . ▁It ▁was ▁developed ▁by ▁Robert ▁S . ▁Bo yer ▁and ▁J ▁St ro ther ▁Moore ▁in ▁ 1 9 7 7 . ▁The ▁original ▁paper ▁contained ▁static ▁tables ▁for ▁computing ▁the ▁pattern ▁sh ifts ▁without ▁an ▁explanation ▁of ▁how ▁to ▁produce ▁them . ▁The ▁algorithm ▁for ▁producing ▁the ▁tables ▁was ▁published ▁in ▁a ▁follow - on ▁paper ; ▁this ▁paper ▁contained ▁errors ▁which ▁were ▁later ▁corrected ▁by ▁Woj cie ch ▁R yt ter ▁in ▁ 1 9 8 0 . ▁The ▁algorithm ▁pre process es ▁the ▁string ▁being ▁searched ▁for ▁( the ▁pattern ), ▁but ▁not ▁the ▁string ▁being ▁searched ▁in ▁( the ▁text ). ▁It ▁is ▁thus ▁well - su ited ▁for ▁applications ▁in ▁which ▁the ▁pattern ▁is ▁much ▁shorter ▁than ▁the ▁text ▁or ▁where ▁it ▁pers ists ▁across ▁multiple ▁searches . ▁The ▁Bo yer – Mo ore ▁algorithm ▁uses ▁information ▁gathered ▁during