GENERAL ENQUIRIES: Tel: + 27 12 841 2911 | Email: callcentre@csir.co.za

Show simple item record

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 Presentation en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ResearchSpace


Advanced Search

Browse

My Account