String Matching with Involutions

Grozea, Cristian, Manea, Florin, Müller, Mike and Nowotka, Dirk (2012) String Matching with Involutions [Paper] In: Unconventional Computation and Natural Computation (UCNC), 3-7 Sept 2012, Orléans, France.


Download (321Kb) | Preview

Supplementary data:


In this note we propose a novel algorithm for locating in a text T every occurrence of a strings that can be obtained from a given pattern P by successively applying antimorphic involutions on some of its factors. When the factors on which these involutions are applied overlap, a linear time algorithm is obtained. When we apply the involutions to non-overlapping factors we obtain an algorithm running in O(|T||P|) time and O(|P|) space, in the worst case. We also improve the latter algorithm to achieve linear average running time, when the alphabet of the pattern is large enough.

Document Type: Conference or Workshop Item (Paper)
Keywords: algorithms on words string matching involution
Research affiliation: ?? dep_sys ??
DOI etc.: 10.1007/978-3-642-32894-7_11
ISSN: 0302-9743
Date Deposited: 21 Jan 2013 12:40
Last Modified: 15 Feb 2013 21:09

Actions (login required)

View Item View Item

Document Downloads

More statistics for this item...