Three Strategies for the Dead-Zone String Matching Algorithm

Jacqueline W. Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce Watson

Allbwn ymchwil: Cyfraniad at gynhadleddPapuradolygiad gan gymheiriaid


Online exact string matching consists in locating all the occurrences of a pattern in a text where only the pattern can be preprocessed. Classical online exact string matching algorithms scan the text from start to end through a window whose size is equal to the pattern length. Exact string matching algorithms from the dead-zone family first locate the window in the middle of the text, compare the content of the window and the pattern and then recursively apply the same procedure on the left part and on the right part of the text while possibly excluding some parts of the text. We propose three different strategies for performing the symbol comparisons and, we compute the shifts for determining the left and right parts of the text at each recursive call
Iaith wreiddiolSaesneg
StatwsCyhoeddwyd - 2018
DigwyddiadPrague Stringology Conference 2018 - Czech Technical University, Prague, Y Weriniaeth Tsiec
Hyd: 27 Awst 201828 Awst 2018


CynhadleddPrague Stringology Conference 2018
Gwlad/TiriogaethY Weriniaeth Tsiec
Cyfnod27 Awst 201828 Awst 2018

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Three Strategies for the Dead-Zone String Matching Algorithm'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn