String matching with involutions

Authors:
Cristian Grozea;Florin Manea;Mike Müller;Dirk Nowotka
Affiliations:
Fraunhofer Institute First, Berlin, Germany;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany;Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany
Venue:
UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Year:
2012

Citing 6
Cited 0

Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
New and faster filters for multiple approximate string matching

Random Structures & Algorithms
Linear work suffix array construction

Journal of the ACM (JACM)
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition
String matching with inversions and translocations in linear average time (most of the time)

Information Processing Letters
Efficient matching of biological sequences allowing for non-overlapping inversions

CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel algorithm for locating in a text T every occurrence of a string 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 ${\mathcal{O}}(|T||P|)$ time and ${\mathcal{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.