Significant subpatterns matching

Authors:
Jan Šupol
Affiliations:
Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague 2
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 2
Cited 0

A new approach to text searching

Communications of the ACM
Approximate regular expression searching with arbitrary integer weights

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for matching significant subpatterns of a given pattern in a text. The significant subpattern is any subpattern of the pattern which is at least of some specified length. We use bit-parallel simulation of an automaton for matching all subpatterns. The bit-parallel approach enables us to count the length of longest subpatterns.