dc.contributor.author |
Daykin, JW
|
|
dc.contributor.author |
Groult, R
|
|
dc.contributor.author |
Guesnet, G
|
|
dc.contributor.author |
Lecroq, T
|
|
dc.contributor.author |
Lefebvre, A
|
|
dc.contributor.author |
Léonard, L
|
|
dc.contributor.author |
Mouchard, L
|
|
dc.contributor.author |
Prieur-Gaston, E
|
|
dc.contributor.author |
Watson, Bruce
|
|
dc.date.accessioned |
2019-04-10T10:53:41Z |
|
dc.date.available |
2019-04-10T10:53:41Z |
|
dc.date.issued |
2018-08 |
|
dc.identifier.citation |
Daykin, J.W., Grout, R., Guesnet, G., Lecroq, T., Lefebvre, A., Léonard, L., Mouchard, L. & Prieur-Gaston, E. 2018. Three Strategies for the Dead-Zone String Matching Algorithm, pp. 117–128. Proceedings of PSC 2018, Jan Holub and Jan Zdˇ ’arek (Eds.), ISBN 978-80-01-06484-9 ´Czech Technical University in Prague, Czech Republic |
en_US |
dc.identifier.isbn |
978-80-01-06484-9 |
|
dc.identifier.uri |
http://www.stringology.org/papers/PSC2018.pdf
|
|
dc.identifier.uri |
http://hdl.handle.net/10204/10937
|
|
dc.description |
Presented at: Proceedings of the Prague Stringology Conference 2018, Prague, Czech Republic, 29-31 August 2018. Due to copyright restrictions, the attached PDF file only contains the abstract of the full-text item. For access to the full-text item, please consult the publisher's website. While waiting for the post-print or published PDF document from the publisher |
en_US |
dc.description.abstract |
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 deadzone 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. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Prague Stringology Club |
en_US |
dc.relation.ispartofseries |
Workflow;22166 |
|
dc.subject |
Exact string matching algorithms |
en_US |
dc.subject |
Dead-zone strategy |
en_US |
dc.subject |
Online |
en_US |
dc.subject |
Recursion |
en_US |
dc.title |
Three strategies for the dead-zone string matching algorithm |
en_US |
dc.type |
Conference Presentation |
en_US |
dc.identifier.apacitation |
Daykin, J., Groult, R., Guesnet, G., Lecroq, T., Lefebvre, A., Léonard, L., ... Watson, B. (2018). Three strategies for the dead-zone string matching algorithm. Prague Stringology Club. http://hdl.handle.net/10204/10937 |
en_ZA |
dc.identifier.chicagocitation |
Daykin, JW, R Groult, G Guesnet, T Lecroq, A Lefebvre, L Léonard, L Mouchard, E Prieur-Gaston, and Bruce Watson. "Three strategies for the dead-zone string matching algorithm." (2018): http://hdl.handle.net/10204/10937 |
en_ZA |
dc.identifier.vancouvercitation |
Daykin J, Groult R, Guesnet G, Lecroq T, Lefebvre A, Léonard L, et al, Three strategies for the dead-zone string matching algorithm; Prague Stringology Club; 2018. http://hdl.handle.net/10204/10937 . |
en_ZA |
dc.identifier.ris |
TY - Conference Presentation
AU - Daykin, JW
AU - Groult, R
AU - Guesnet, G
AU - Lecroq, T
AU - Lefebvre, A
AU - Léonard, L
AU - Mouchard, L
AU - Prieur-Gaston, E
AU - Watson, Bruce
AB - 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 deadzone 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.
DA - 2018-08
DB - ResearchSpace
DP - CSIR
KW - Exact string matching algorithms
KW - Dead-zone strategy
KW - Online
KW - Recursion
LK - https://researchspace.csir.co.za
PY - 2018
SM - 978-80-01-06484-9
T1 - Three strategies for the dead-zone string matching algorithm
TI - Three strategies for the dead-zone string matching algorithm
UR - http://hdl.handle.net/10204/10937
ER -
|
en_ZA |